./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6af52310ec13e6e7a94146d05f9e904086453aae ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/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-1dbac8b [2018-10-27 05:47:58,132 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 05:47:58,134 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 05:47:58,145 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 05:47:58,146 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 05:47:58,147 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 05:47:58,148 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 05:47:58,149 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 05:47:58,150 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 05:47:58,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 05:47:58,151 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 05:47:58,154 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 05:47:58,155 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 05:47:58,157 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 05:47:58,163 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 05:47:58,164 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 05:47:58,165 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 05:47:58,166 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 05:47:58,167 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 05:47:58,168 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 05:47:58,169 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 05:47:58,170 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 05:47:58,172 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 05:47:58,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 05:47:58,172 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 05:47:58,173 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 05:47:58,173 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 05:47:58,174 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 05:47:58,174 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 05:47:58,176 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 05:47:58,176 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 05:47:58,177 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 05:47:58,177 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 05:47:58,177 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 05:47:58,178 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 05:47:58,178 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 05:47:58,178 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-10-27 05:47:58,189 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 05:47:58,190 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 05:47:58,190 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 05:47:58,190 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 05:47:58,191 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 05:47:58,191 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 05:47:58,191 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 05:47:58,191 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 05:47:58,191 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 05:47:58,191 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 05:47:58,191 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 05:47:58,192 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 05:47:58,192 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 05:47:58,192 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 05:47:58,192 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 05:47:58,192 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 05:47:58,193 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 05:47:58,193 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 05:47:58,193 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 05:47:58,193 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 05:47:58,193 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-10-27 05:47:58,193 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 05:47:58,193 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 05:47:58,193 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 05:47:58,194 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 05:47:58,194 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 05:47:58,194 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 05:47:58,194 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 05:47:58,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 05:47:58,194 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 05:47:58,194 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 05:47:58,195 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 05:47:58,195 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 05:47:58,195 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 05:47:58,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 05:47:58,198 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 05:47:58,198 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan 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 -> Taipan 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 -> 6af52310ec13e6e7a94146d05f9e904086453aae [2018-10-27 05:47:58,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 05:47:58,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 05:47:58,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 05:47:58,248 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 05:47:58,248 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 05:47:58,249 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i [2018-10-27 05:47:58,305 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/data/497d2e875/b4c24dbc873741acb6eb65b59fe1d499/FLAGb61c0f7af [2018-10-27 05:47:58,668 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 05:47:58,668 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i [2018-10-27 05:47:58,675 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/data/497d2e875/b4c24dbc873741acb6eb65b59fe1d499/FLAGb61c0f7af [2018-10-27 05:47:58,686 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/data/497d2e875/b4c24dbc873741acb6eb65b59fe1d499 [2018-10-27 05:47:58,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 05:47:58,690 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 05:47:58,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 05:47:58,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 05:47:58,694 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 05:47:58,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:47:58" (1/1) ... [2018-10-27 05:47:58,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b6b23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:58, skipping insertion in model container [2018-10-27 05:47:58,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:47:58" (1/1) ... [2018-10-27 05:47:58,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 05:47:58,727 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 05:47:58,882 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:47:58,885 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 05:47:58,928 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:47:58,937 INFO L193 MainTranslator]: Completed translation [2018-10-27 05:47:58,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:58 WrapperNode [2018-10-27 05:47:58,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 05:47:58,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 05:47:58,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 05:47:58,938 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 05:47:58,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:58" (1/1) ... [2018-10-27 05:47:58,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:58" (1/1) ... [2018-10-27 05:47:58,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 05:47:58,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 05:47:58,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 05:47:58,966 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 05:47:58,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:58" (1/1) ... [2018-10-27 05:47:58,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:58" (1/1) ... [2018-10-27 05:47:58,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:58" (1/1) ... [2018-10-27 05:47:58,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:58" (1/1) ... [2018-10-27 05:47:58,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:58" (1/1) ... [2018-10-27 05:47:58,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:58" (1/1) ... [2018-10-27 05:47:59,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:58" (1/1) ... [2018-10-27 05:47:59,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 05:47:59,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 05:47:59,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 05:47:59,002 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 05:47:59,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/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-10-27 05:47:59,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 05:47:59,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 05:47:59,158 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-10-27 05:47:59,158 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-10-27 05:47:59,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 05:47:59,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 05:47:59,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 05:47:59,158 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 05:47:59,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 05:47:59,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 05:48:00,007 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 05:48:00,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:48:00 BoogieIcfgContainer [2018-10-27 05:48:00,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 05:48:00,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 05:48:00,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 05:48:00,011 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 05:48:00,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:47:58" (1/3) ... [2018-10-27 05:48:00,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4632f52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:48:00, skipping insertion in model container [2018-10-27 05:48:00,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:58" (2/3) ... [2018-10-27 05:48:00,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4632f52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:48:00, skipping insertion in model container [2018-10-27 05:48:00,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:48:00" (3/3) ... [2018-10-27 05:48:00,015 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-no-overflow.i [2018-10-27 05:48:00,022 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 05:48:00,029 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2018-10-27 05:48:00,043 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2018-10-27 05:48:00,074 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 05:48:00,074 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 05:48:00,074 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 05:48:00,074 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 05:48:00,074 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 05:48:00,075 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 05:48:00,075 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 05:48:00,075 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 05:48:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-10-27 05:48:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-27 05:48:00,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:00,101 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:48:00,104 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:00,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:00,110 INFO L82 PathProgramCache]: Analyzing trace with hash 695440543, now seen corresponding path program 1 times [2018-10-27 05:48:00,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:00,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:00,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:00,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:00,164 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:00,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:48:00,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:00,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-27 05:48:00,253 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:00,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 05:48:00,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 05:48:00,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 05:48:00,274 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 2 states. [2018-10-27 05:48:00,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:00,298 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2018-10-27 05:48:00,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 05:48:00,300 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-10-27 05:48:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:00,309 INFO L225 Difference]: With dead ends: 157 [2018-10-27 05:48:00,309 INFO L226 Difference]: Without dead ends: 76 [2018-10-27 05:48:00,312 INFO L605 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-10-27 05:48:00,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-27 05:48:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-27 05:48:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-27 05:48:00,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2018-10-27 05:48:00,351 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 9 [2018-10-27 05:48:00,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:00,351 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2018-10-27 05:48:00,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 05:48:00,352 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2018-10-27 05:48:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 05:48:00,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:00,353 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-10-27 05:48:00,354 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:00,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:00,354 INFO L82 PathProgramCache]: Analyzing trace with hash 159052589, now seen corresponding path program 1 times [2018-10-27 05:48:00,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:00,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:00,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:00,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:00,356 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:48:00,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:00,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 05:48:00,494 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:00,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:48:00,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:48:00,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:48:00,497 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2018-10-27 05:48:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:00,882 INFO L93 Difference]: Finished difference Result 156 states and 223 transitions. [2018-10-27 05:48:00,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:48:00,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-27 05:48:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:00,884 INFO L225 Difference]: With dead ends: 156 [2018-10-27 05:48:00,884 INFO L226 Difference]: Without dead ends: 107 [2018-10-27 05:48:00,886 INFO L605 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-10-27 05:48:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-27 05:48:00,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-10-27 05:48:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-27 05:48:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2018-10-27 05:48:00,897 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 20 [2018-10-27 05:48:00,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:00,897 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2018-10-27 05:48:00,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:48:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2018-10-27 05:48:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 05:48:00,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:00,899 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-10-27 05:48:00,900 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:00,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:00,901 INFO L82 PathProgramCache]: Analyzing trace with hash -729622569, now seen corresponding path program 1 times [2018-10-27 05:48:00,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:00,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:00,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:00,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:00,902 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:48:01,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:01,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:48:01,013 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:01,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:48:01,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:48:01,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:48:01,016 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand 4 states. [2018-10-27 05:48:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:01,626 INFO L93 Difference]: Finished difference Result 203 states and 290 transitions. [2018-10-27 05:48:01,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:48:01,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-10-27 05:48:01,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:01,628 INFO L225 Difference]: With dead ends: 203 [2018-10-27 05:48:01,628 INFO L226 Difference]: Without dead ends: 154 [2018-10-27 05:48:01,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:48:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-27 05:48:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2018-10-27 05:48:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-27 05:48:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 164 transitions. [2018-10-27 05:48:01,638 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 164 transitions. Word has length 28 [2018-10-27 05:48:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:01,638 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 164 transitions. [2018-10-27 05:48:01,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:48:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2018-10-27 05:48:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 05:48:01,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:01,639 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-10-27 05:48:01,642 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:01,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:01,642 INFO L82 PathProgramCache]: Analyzing trace with hash -562350907, now seen corresponding path program 1 times [2018-10-27 05:48:01,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:01,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:01,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:01,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:01,644 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 05:48:01,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:01,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:48:01,713 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:01,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:48:01,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:48:01,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:48:01,714 INFO L87 Difference]: Start difference. First operand 130 states and 164 transitions. Second operand 4 states. [2018-10-27 05:48:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:02,131 INFO L93 Difference]: Finished difference Result 303 states and 414 transitions. [2018-10-27 05:48:02,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:48:02,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-10-27 05:48:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:02,133 INFO L225 Difference]: With dead ends: 303 [2018-10-27 05:48:02,134 INFO L226 Difference]: Without dead ends: 207 [2018-10-27 05:48:02,134 INFO L605 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-10-27 05:48:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-27 05:48:02,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 171. [2018-10-27 05:48:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-27 05:48:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2018-10-27 05:48:02,147 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 36 [2018-10-27 05:48:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:02,148 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2018-10-27 05:48:02,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:48:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2018-10-27 05:48:02,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-27 05:48:02,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:02,150 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-10-27 05:48:02,151 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:02,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:02,153 INFO L82 PathProgramCache]: Analyzing trace with hash -980375313, now seen corresponding path program 1 times [2018-10-27 05:48:02,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:02,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:02,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:02,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:02,155 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 05:48:02,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:02,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 05:48:02,288 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:02,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:48:02,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:48:02,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:48:02,290 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 5 states. [2018-10-27 05:48:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:02,678 INFO L93 Difference]: Finished difference Result 482 states and 629 transitions. [2018-10-27 05:48:02,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:48:02,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-10-27 05:48:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:02,680 INFO L225 Difference]: With dead ends: 482 [2018-10-27 05:48:02,680 INFO L226 Difference]: Without dead ends: 342 [2018-10-27 05:48:02,681 INFO L605 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-10-27 05:48:02,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-27 05:48:02,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 185. [2018-10-27 05:48:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-27 05:48:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 240 transitions. [2018-10-27 05:48:02,694 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 240 transitions. Word has length 44 [2018-10-27 05:48:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:02,695 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 240 transitions. [2018-10-27 05:48:02,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:48:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 240 transitions. [2018-10-27 05:48:02,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-27 05:48:02,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:02,698 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-10-27 05:48:02,699 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:02,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:02,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1975473950, now seen corresponding path program 1 times [2018-10-27 05:48:02,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:02,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:02,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:02,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:02,703 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 05:48:02,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:02,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 05:48:02,782 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:02,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:48:02,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:48:02,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:48:02,783 INFO L87 Difference]: Start difference. First operand 185 states and 240 transitions. Second operand 5 states. [2018-10-27 05:48:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:03,012 INFO L93 Difference]: Finished difference Result 490 states and 637 transitions. [2018-10-27 05:48:03,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:48:03,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-10-27 05:48:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:03,014 INFO L225 Difference]: With dead ends: 490 [2018-10-27 05:48:03,014 INFO L226 Difference]: Without dead ends: 350 [2018-10-27 05:48:03,014 INFO L605 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-10-27 05:48:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-27 05:48:03,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 200. [2018-10-27 05:48:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-27 05:48:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 256 transitions. [2018-10-27 05:48:03,027 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 256 transitions. Word has length 47 [2018-10-27 05:48:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:03,028 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 256 transitions. [2018-10-27 05:48:03,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:48:03,028 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 256 transitions. [2018-10-27 05:48:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-27 05:48:03,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:03,030 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-10-27 05:48:03,031 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:03,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:03,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1943837068, now seen corresponding path program 1 times [2018-10-27 05:48:03,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:03,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:03,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:03,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:03,035 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 05:48:03,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:03,142 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:03,143 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-10-27 05:48:03,144 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [35], [37], [39], [58], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:03,186 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:03,187 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:03,322 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:03,371 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:03,372 INFO L272 AbstractInterpreter]: Visited 19 different actions 19 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-10-27 05:48:03,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:03,392 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:03,525 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 82.4% of their original sizes. [2018-10-27 05:48:03,525 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:03,805 INFO L415 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-10-27 05:48:03,805 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:03,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:03,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-10-27 05:48:03,806 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:03,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:48:03,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:48:03,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:48:03,807 INFO L87 Difference]: Start difference. First operand 200 states and 256 transitions. Second operand 7 states. [2018-10-27 05:48:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:05,731 INFO L93 Difference]: Finished difference Result 949 states and 1235 transitions. [2018-10-27 05:48:05,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 05:48:05,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-10-27 05:48:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:05,734 INFO L225 Difference]: With dead ends: 949 [2018-10-27 05:48:05,734 INFO L226 Difference]: Without dead ends: 809 [2018-10-27 05:48:05,734 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:48:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-10-27 05:48:05,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 205. [2018-10-27 05:48:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-27 05:48:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 263 transitions. [2018-10-27 05:48:05,749 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 263 transitions. Word has length 50 [2018-10-27 05:48:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:05,749 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 263 transitions. [2018-10-27 05:48:05,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:48:05,749 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 263 transitions. [2018-10-27 05:48:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-27 05:48:05,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:05,751 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, 1, 1, 1] [2018-10-27 05:48:05,753 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:05,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1484555764, now seen corresponding path program 1 times [2018-10-27 05:48:05,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:05,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:05,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:05,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:05,754 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 05:48:05,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:05,834 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:05,835 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-10-27 05:48:05,835 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [24], [32], [35], [37], [39], [58], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:05,836 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:05,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:05,847 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:05,864 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:05,865 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-10-27 05:48:05,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:05,867 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:05,919 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 84.53% of their original sizes. [2018-10-27 05:48:05,919 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:06,449 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-10-27 05:48:06,449 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:06,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:06,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-10-27 05:48:06,449 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:06,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 05:48:06,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 05:48:06,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-27 05:48:06,450 INFO L87 Difference]: Start difference. First operand 205 states and 263 transitions. Second operand 8 states. [2018-10-27 05:48:09,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:09,296 INFO L93 Difference]: Finished difference Result 1119 states and 1455 transitions. [2018-10-27 05:48:09,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 05:48:09,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-10-27 05:48:09,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:09,301 INFO L225 Difference]: With dead ends: 1119 [2018-10-27 05:48:09,301 INFO L226 Difference]: Without dead ends: 979 [2018-10-27 05:48:09,302 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-27 05:48:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2018-10-27 05:48:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 205. [2018-10-27 05:48:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-27 05:48:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 263 transitions. [2018-10-27 05:48:09,316 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 263 transitions. Word has length 53 [2018-10-27 05:48:09,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:09,319 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 263 transitions. [2018-10-27 05:48:09,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 05:48:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 263 transitions. [2018-10-27 05:48:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-27 05:48:09,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:09,321 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, 1, 1, 1] [2018-10-27 05:48:09,321 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:09,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:09,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1294932405, now seen corresponding path program 1 times [2018-10-27 05:48:09,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:09,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:09,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:09,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:09,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 05:48:09,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:09,540 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:09,540 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-10-27 05:48:09,540 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [35], [37], [39], [42], [44], [46], [55], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:09,542 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:09,542 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:09,553 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:09,565 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:09,565 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-10-27 05:48:09,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:09,583 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:09,633 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 82.92% of their original sizes. [2018-10-27 05:48:09,633 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:09,704 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-10-27 05:48:09,704 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:09,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:09,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-10-27 05:48:09,704 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:09,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 05:48:09,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 05:48:09,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-27 05:48:09,705 INFO L87 Difference]: Start difference. First operand 205 states and 263 transitions. Second operand 8 states. [2018-10-27 05:48:13,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:13,628 INFO L93 Difference]: Finished difference Result 1106 states and 1438 transitions. [2018-10-27 05:48:13,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 05:48:13,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-10-27 05:48:13,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:13,631 INFO L225 Difference]: With dead ends: 1106 [2018-10-27 05:48:13,631 INFO L226 Difference]: Without dead ends: 966 [2018-10-27 05:48:13,632 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-27 05:48:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2018-10-27 05:48:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 213. [2018-10-27 05:48:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-27 05:48:13,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 274 transitions. [2018-10-27 05:48:13,644 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 274 transitions. Word has length 53 [2018-10-27 05:48:13,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:13,644 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 274 transitions. [2018-10-27 05:48:13,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 05:48:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 274 transitions. [2018-10-27 05:48:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-27 05:48:13,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:13,646 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, 1, 1, 1, 1, 1] [2018-10-27 05:48:13,646 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:13,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:13,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1735225144, now seen corresponding path program 1 times [2018-10-27 05:48:13,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:13,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:13,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:13,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:13,652 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 05:48:13,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:13,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:13,733 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-10-27 05:48:13,733 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [18], [20], [22], [32], [35], [37], [39], [58], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:13,734 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:13,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:13,741 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:13,749 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:13,749 INFO L272 AbstractInterpreter]: Visited 24 different actions 24 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-10-27 05:48:13,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:13,755 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:13,794 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 85.18% of their original sizes. [2018-10-27 05:48:13,794 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:13,845 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-10-27 05:48:13,845 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:13,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:13,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-10-27 05:48:13,845 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:13,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 05:48:13,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 05:48:13,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:48:13,846 INFO L87 Difference]: Start difference. First operand 213 states and 274 transitions. Second operand 9 states. [2018-10-27 05:48:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:15,261 INFO L93 Difference]: Finished difference Result 1123 states and 1459 transitions. [2018-10-27 05:48:15,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:48:15,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-10-27 05:48:15,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:15,264 INFO L225 Difference]: With dead ends: 1123 [2018-10-27 05:48:15,264 INFO L226 Difference]: Without dead ends: 983 [2018-10-27 05:48:15,265 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:48:15,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2018-10-27 05:48:15,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 208. [2018-10-27 05:48:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-27 05:48:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 267 transitions. [2018-10-27 05:48:15,280 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 267 transitions. Word has length 55 [2018-10-27 05:48:15,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:15,281 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 267 transitions. [2018-10-27 05:48:15,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 05:48:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 267 transitions. [2018-10-27 05:48:15,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-27 05:48:15,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:15,282 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, 1, 1, 1, 1, 1] [2018-10-27 05:48:15,282 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:15,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:15,283 INFO L82 PathProgramCache]: Analyzing trace with hash 873473489, now seen corresponding path program 1 times [2018-10-27 05:48:15,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:15,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:15,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:15,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:15,288 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 05:48:15,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:15,463 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:15,463 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-10-27 05:48:15,464 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [35], [37], [39], [42], [44], [46], [49], [51], [53], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:15,465 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:15,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:15,472 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:15,483 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:15,483 INFO L272 AbstractInterpreter]: Visited 24 different actions 24 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-10-27 05:48:15,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:15,524 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:15,566 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 83.12% of their original sizes. [2018-10-27 05:48:15,567 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:15,751 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-10-27 05:48:15,751 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:15,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:15,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-10-27 05:48:15,752 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:15,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 05:48:15,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 05:48:15,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:48:15,753 INFO L87 Difference]: Start difference. First operand 208 states and 267 transitions. Second operand 9 states. [2018-10-27 05:48:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:17,311 INFO L93 Difference]: Finished difference Result 1104 states and 1432 transitions. [2018-10-27 05:48:17,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:48:17,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-10-27 05:48:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:17,314 INFO L225 Difference]: With dead ends: 1104 [2018-10-27 05:48:17,314 INFO L226 Difference]: Without dead ends: 964 [2018-10-27 05:48:17,318 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:48:17,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-10-27 05:48:17,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 210. [2018-10-27 05:48:17,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-27 05:48:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 269 transitions. [2018-10-27 05:48:17,337 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 269 transitions. Word has length 55 [2018-10-27 05:48:17,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:17,338 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 269 transitions. [2018-10-27 05:48:17,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 05:48:17,338 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 269 transitions. [2018-10-27 05:48:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-27 05:48:17,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:17,341 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, 1, 1, 1, 1, 1, 1] [2018-10-27 05:48:17,342 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:17,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:17,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2071475659, now seen corresponding path program 1 times [2018-10-27 05:48:17,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:17,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:17,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:17,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:17,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 05:48:17,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:17,525 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:17,525 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-27 05:48:17,525 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [24], [32], [35], [37], [39], [42], [44], [46], [55], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:17,527 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:17,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:17,532 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:17,542 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:17,542 INFO L272 AbstractInterpreter]: Visited 25 different actions 25 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-10-27 05:48:17,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:17,543 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:17,573 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 84.79% of their original sizes. [2018-10-27 05:48:17,573 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:17,610 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-10-27 05:48:17,610 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:17,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:17,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-10-27 05:48:17,611 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:17,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 05:48:17,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 05:48:17,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:48:17,611 INFO L87 Difference]: Start difference. First operand 210 states and 269 transitions. Second operand 9 states. [2018-10-27 05:48:18,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:18,866 INFO L93 Difference]: Finished difference Result 1263 states and 1641 transitions. [2018-10-27 05:48:18,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:48:18,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-10-27 05:48:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:18,868 INFO L225 Difference]: With dead ends: 1263 [2018-10-27 05:48:18,869 INFO L226 Difference]: Without dead ends: 1123 [2018-10-27 05:48:18,869 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:48:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-10-27 05:48:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 218. [2018-10-27 05:48:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-27 05:48:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 280 transitions. [2018-10-27 05:48:18,884 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 280 transitions. Word has length 56 [2018-10-27 05:48:18,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:18,884 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 280 transitions. [2018-10-27 05:48:18,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 05:48:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 280 transitions. [2018-10-27 05:48:18,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-27 05:48:18,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:18,886 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-10-27 05:48:18,886 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:18,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:18,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1520788288, now seen corresponding path program 1 times [2018-10-27 05:48:18,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:18,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:18,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:18,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:18,892 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 05:48:19,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:19,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 05:48:19,022 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:19,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:48:19,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:48:19,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:48:19,023 INFO L87 Difference]: Start difference. First operand 218 states and 280 transitions. Second operand 3 states. [2018-10-27 05:48:19,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:19,099 INFO L93 Difference]: Finished difference Result 281 states and 360 transitions. [2018-10-27 05:48:19,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:48:19,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-10-27 05:48:19,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:19,102 INFO L225 Difference]: With dead ends: 281 [2018-10-27 05:48:19,102 INFO L226 Difference]: Without dead ends: 248 [2018-10-27 05:48:19,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:48:19,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-27 05:48:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-10-27 05:48:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-27 05:48:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 318 transitions. [2018-10-27 05:48:19,118 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 318 transitions. Word has length 56 [2018-10-27 05:48:19,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:19,118 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 318 transitions. [2018-10-27 05:48:19,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:48:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 318 transitions. [2018-10-27 05:48:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-27 05:48:19,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:19,120 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-10-27 05:48:19,120 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:19,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:19,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1246028674, now seen corresponding path program 1 times [2018-10-27 05:48:19,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:19,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:19,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:19,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:19,121 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 05:48:19,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:19,258 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:19,258 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-27 05:48:19,258 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [61], [63], [67], [71], [73], [118], [122], [125], [127], [129], [141], [151], [161], [170], [174], [182], [188], [194], [197], [199], [205], [209], [211], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:19,260 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:19,260 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:19,267 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:19,282 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:19,282 INFO L272 AbstractInterpreter]: Visited 18 different actions 18 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-10-27 05:48:19,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:19,283 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:19,318 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 78.34% of their original sizes. [2018-10-27 05:48:19,319 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:19,403 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-10-27 05:48:19,403 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:19,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:19,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-10-27 05:48:19,404 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:19,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:48:19,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:48:19,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:48:19,405 INFO L87 Difference]: Start difference. First operand 248 states and 318 transitions. Second operand 7 states. [2018-10-27 05:48:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:19,840 INFO L93 Difference]: Finished difference Result 964 states and 1244 transitions. [2018-10-27 05:48:19,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 05:48:19,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-10-27 05:48:19,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:19,842 INFO L225 Difference]: With dead ends: 964 [2018-10-27 05:48:19,842 INFO L226 Difference]: Without dead ends: 796 [2018-10-27 05:48:19,843 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:48:19,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-10-27 05:48:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 248. [2018-10-27 05:48:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-27 05:48:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 318 transitions. [2018-10-27 05:48:19,864 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 318 transitions. Word has length 56 [2018-10-27 05:48:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:19,865 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 318 transitions. [2018-10-27 05:48:19,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:48:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 318 transitions. [2018-10-27 05:48:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-27 05:48:19,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:19,866 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-10-27 05:48:19,866 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:19,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:19,866 INFO L82 PathProgramCache]: Analyzing trace with hash -309874275, now seen corresponding path program 1 times [2018-10-27 05:48:19,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:19,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:19,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:19,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:19,872 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 05:48:20,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:20,069 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:20,070 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-27 05:48:20,070 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [35], [37], [39], [58], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [164], [170], [174], [182], [188], [194], [197], [199], [205], [209], [211], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:20,071 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:20,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:20,076 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:20,085 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:20,085 INFO L272 AbstractInterpreter]: Visited 25 different actions 25 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-10-27 05:48:20,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:20,088 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:20,131 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 71.79% of their original sizes. [2018-10-27 05:48:20,131 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:20,299 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-10-27 05:48:20,299 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:20,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:20,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2018-10-27 05:48:20,300 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:20,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 05:48:20,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 05:48:20,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-27 05:48:20,301 INFO L87 Difference]: Start difference. First operand 248 states and 318 transitions. Second operand 8 states. [2018-10-27 05:48:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:21,541 INFO L93 Difference]: Finished difference Result 952 states and 1232 transitions. [2018-10-27 05:48:21,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 05:48:21,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-10-27 05:48:21,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:21,543 INFO L225 Difference]: With dead ends: 952 [2018-10-27 05:48:21,543 INFO L226 Difference]: Without dead ends: 785 [2018-10-27 05:48:21,544 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-27 05:48:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-10-27 05:48:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 248. [2018-10-27 05:48:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-27 05:48:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 318 transitions. [2018-10-27 05:48:21,561 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 318 transitions. Word has length 56 [2018-10-27 05:48:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:21,561 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 318 transitions. [2018-10-27 05:48:21,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 05:48:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 318 transitions. [2018-10-27 05:48:21,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-27 05:48:21,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:21,562 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:48:21,563 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:21,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:21,563 INFO L82 PathProgramCache]: Analyzing trace with hash 966863473, now seen corresponding path program 1 times [2018-10-27 05:48:21,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:21,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:21,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:21,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:21,569 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 05:48:21,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:21,665 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:21,665 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-10-27 05:48:21,665 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [18], [20], [22], [32], [35], [37], [39], [42], [44], [46], [55], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:21,667 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:21,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:21,671 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:21,679 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:21,679 INFO L272 AbstractInterpreter]: Visited 27 different actions 27 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-10-27 05:48:21,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:21,683 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:21,705 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 85.31% of their original sizes. [2018-10-27 05:48:21,706 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:21,755 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-10-27 05:48:21,755 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:21,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:21,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-10-27 05:48:21,755 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:21,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 05:48:21,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 05:48:21,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:48:21,756 INFO L87 Difference]: Start difference. First operand 248 states and 318 transitions. Second operand 10 states. [2018-10-27 05:48:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:22,869 INFO L93 Difference]: Finished difference Result 1499 states and 1940 transitions. [2018-10-27 05:48:22,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 05:48:22,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-10-27 05:48:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:22,872 INFO L225 Difference]: With dead ends: 1499 [2018-10-27 05:48:22,872 INFO L226 Difference]: Without dead ends: 1329 [2018-10-27 05:48:22,873 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:48:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2018-10-27 05:48:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 240. [2018-10-27 05:48:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-27 05:48:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 307 transitions. [2018-10-27 05:48:22,892 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 307 transitions. Word has length 58 [2018-10-27 05:48:22,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:22,892 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 307 transitions. [2018-10-27 05:48:22,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 05:48:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 307 transitions. [2018-10-27 05:48:22,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-27 05:48:22,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:22,893 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:48:22,893 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:22,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:22,894 INFO L82 PathProgramCache]: Analyzing trace with hash -134302127, now seen corresponding path program 1 times [2018-10-27 05:48:22,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:22,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:22,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:22,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:22,895 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 05:48:22,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:22,975 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:22,975 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-10-27 05:48:22,975 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [24], [32], [35], [37], [39], [42], [44], [46], [49], [51], [53], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:22,976 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:22,976 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:22,982 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:22,992 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:22,992 INFO L272 AbstractInterpreter]: Visited 27 different actions 27 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-10-27 05:48:22,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:22,999 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:23,031 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 84.88% of their original sizes. [2018-10-27 05:48:23,031 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:23,123 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-10-27 05:48:23,123 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:23,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:23,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-10-27 05:48:23,124 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:23,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 05:48:23,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 05:48:23,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:48:23,125 INFO L87 Difference]: Start difference. First operand 240 states and 307 transitions. Second operand 10 states. [2018-10-27 05:48:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:23,883 INFO L93 Difference]: Finished difference Result 1502 states and 1941 transitions. [2018-10-27 05:48:23,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 05:48:23,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-10-27 05:48:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:23,886 INFO L225 Difference]: With dead ends: 1502 [2018-10-27 05:48:23,886 INFO L226 Difference]: Without dead ends: 1332 [2018-10-27 05:48:23,887 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:48:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2018-10-27 05:48:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 242. [2018-10-27 05:48:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-27 05:48:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 310 transitions. [2018-10-27 05:48:23,910 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 310 transitions. Word has length 58 [2018-10-27 05:48:23,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:23,910 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 310 transitions. [2018-10-27 05:48:23,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 05:48:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 310 transitions. [2018-10-27 05:48:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-27 05:48:23,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:23,914 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, 1, 1, 1] [2018-10-27 05:48:23,914 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:23,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:23,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1872665598, now seen corresponding path program 1 times [2018-10-27 05:48:23,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:23,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:23,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:23,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:23,916 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 05:48:24,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:24,036 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:24,037 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-10-27 05:48:24,037 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [24], [32], [61], [63], [67], [71], [73], [118], [122], [125], [127], [129], [141], [151], [161], [170], [174], [182], [188], [194], [197], [199], [205], [209], [211], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:24,038 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:24,038 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:24,048 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:24,056 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:24,056 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-10-27 05:48:24,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:24,075 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:24,117 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 81.49% of their original sizes. [2018-10-27 05:48:24,119 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:24,176 INFO L415 sIntCurrentIteration]: We unified 58 AI predicates to 58 [2018-10-27 05:48:24,176 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:24,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:24,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-10-27 05:48:24,176 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:24,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 05:48:24,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 05:48:24,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-27 05:48:24,177 INFO L87 Difference]: Start difference. First operand 242 states and 310 transitions. Second operand 8 states. [2018-10-27 05:48:25,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:25,561 INFO L93 Difference]: Finished difference Result 1144 states and 1476 transitions. [2018-10-27 05:48:25,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 05:48:25,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-10-27 05:48:25,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:25,563 INFO L225 Difference]: With dead ends: 1144 [2018-10-27 05:48:25,564 INFO L226 Difference]: Without dead ends: 976 [2018-10-27 05:48:25,564 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-27 05:48:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-10-27 05:48:25,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 240. [2018-10-27 05:48:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-27 05:48:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 307 transitions. [2018-10-27 05:48:25,584 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 307 transitions. Word has length 59 [2018-10-27 05:48:25,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:25,584 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 307 transitions. [2018-10-27 05:48:25,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 05:48:25,584 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 307 transitions. [2018-10-27 05:48:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-27 05:48:25,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:25,585 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, 1, 1, 1] [2018-10-27 05:48:25,586 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:25,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:25,586 INFO L82 PathProgramCache]: Analyzing trace with hash -658766014, now seen corresponding path program 1 times [2018-10-27 05:48:25,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:25,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:25,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:25,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:25,593 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 05:48:25,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:25,760 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:25,761 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-10-27 05:48:25,761 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [35], [37], [39], [42], [44], [46], [55], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [164], [170], [174], [182], [188], [194], [197], [199], [205], [209], [211], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:25,762 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:25,762 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:25,773 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:25,788 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:25,789 INFO L272 AbstractInterpreter]: Visited 28 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-10-27 05:48:25,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:25,823 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:25,860 INFO L227 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 74.49% of their original sizes. [2018-10-27 05:48:25,861 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:25,966 INFO L415 sIntCurrentIteration]: We unified 58 AI predicates to 58 [2018-10-27 05:48:25,966 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:25,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:25,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-10-27 05:48:25,967 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:25,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 05:48:25,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 05:48:25,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:48:25,967 INFO L87 Difference]: Start difference. First operand 240 states and 307 transitions. Second operand 9 states. [2018-10-27 05:48:26,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:26,741 INFO L93 Difference]: Finished difference Result 1122 states and 1451 transitions. [2018-10-27 05:48:26,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:48:26,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-10-27 05:48:26,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:26,744 INFO L225 Difference]: With dead ends: 1122 [2018-10-27 05:48:26,744 INFO L226 Difference]: Without dead ends: 955 [2018-10-27 05:48:26,745 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:48:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-10-27 05:48:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 240. [2018-10-27 05:48:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-27 05:48:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 307 transitions. [2018-10-27 05:48:26,767 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 307 transitions. Word has length 59 [2018-10-27 05:48:26,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:26,769 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 307 transitions. [2018-10-27 05:48:26,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 05:48:26,769 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 307 transitions. [2018-10-27 05:48:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-27 05:48:26,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:26,770 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, 1, 1, 1] [2018-10-27 05:48:26,770 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:26,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:26,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1130071299, now seen corresponding path program 1 times [2018-10-27 05:48:26,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:26,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:26,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:26,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:26,771 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 05:48:27,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:27,008 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:27,008 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-10-27 05:48:27,009 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [122], [125], [127], [129], [141], [151], [161], [170], [174], [182], [188], [194], [197], [199], [205], [209], [211], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:27,010 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:27,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:27,018 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:27,035 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:27,035 INFO L272 AbstractInterpreter]: Visited 35 different actions 40 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-10-27 05:48:27,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:27,037 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:27,091 INFO L227 lantSequenceWeakener]: Weakened 29 states. On average, predicates are now at 67.72% of their original sizes. [2018-10-27 05:48:27,091 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:27,210 INFO L415 sIntCurrentIteration]: We unified 58 AI predicates to 58 [2018-10-27 05:48:27,210 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:27,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:27,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-10-27 05:48:27,211 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:27,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 05:48:27,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 05:48:27,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:48:27,212 INFO L87 Difference]: Start difference. First operand 240 states and 307 transitions. Second operand 10 states. [2018-10-27 05:48:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:28,057 INFO L93 Difference]: Finished difference Result 800 states and 1028 transitions. [2018-10-27 05:48:28,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 05:48:28,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-10-27 05:48:28,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:28,059 INFO L225 Difference]: With dead ends: 800 [2018-10-27 05:48:28,059 INFO L226 Difference]: Without dead ends: 633 [2018-10-27 05:48:28,060 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:48:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-10-27 05:48:28,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 274. [2018-10-27 05:48:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-27 05:48:28,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 342 transitions. [2018-10-27 05:48:28,093 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 342 transitions. Word has length 59 [2018-10-27 05:48:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:28,094 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 342 transitions. [2018-10-27 05:48:28,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 05:48:28,094 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 342 transitions. [2018-10-27 05:48:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 05:48:28,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:28,095 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:48:28,099 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:28,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:28,100 INFO L82 PathProgramCache]: Analyzing trace with hash -868157555, now seen corresponding path program 1 times [2018-10-27 05:48:28,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:28,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:28,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:28,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:28,101 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 05:48:28,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:28,197 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:28,198 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-10-27 05:48:28,198 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [18], [20], [22], [32], [35], [37], [39], [42], [44], [46], [49], [51], [53], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:28,199 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:28,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:28,204 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:28,211 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:28,211 INFO L272 AbstractInterpreter]: Visited 29 different actions 29 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-10-27 05:48:28,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:28,213 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:28,239 INFO L227 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 85.35% of their original sizes. [2018-10-27 05:48:28,239 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:28,303 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-10-27 05:48:28,303 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:28,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:28,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-10-27 05:48:28,303 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:28,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 05:48:28,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 05:48:28,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:48:28,304 INFO L87 Difference]: Start difference. First operand 274 states and 342 transitions. Second operand 11 states. [2018-10-27 05:48:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:30,510 INFO L93 Difference]: Finished difference Result 1524 states and 1961 transitions. [2018-10-27 05:48:30,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 05:48:30,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-10-27 05:48:30,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:30,513 INFO L225 Difference]: With dead ends: 1524 [2018-10-27 05:48:30,513 INFO L226 Difference]: Without dead ends: 1354 [2018-10-27 05:48:30,514 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:48:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-10-27 05:48:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 259. [2018-10-27 05:48:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-27 05:48:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 323 transitions. [2018-10-27 05:48:30,541 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 323 transitions. Word has length 60 [2018-10-27 05:48:30,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:30,542 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 323 transitions. [2018-10-27 05:48:30,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 05:48:30,542 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 323 transitions. [2018-10-27 05:48:30,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-27 05:48:30,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:30,546 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, 1, 1, 1, 1, 1] [2018-10-27 05:48:30,546 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:30,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:30,546 INFO L82 PathProgramCache]: Analyzing trace with hash 597983810, now seen corresponding path program 1 times [2018-10-27 05:48:30,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:30,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:30,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:30,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:30,547 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:30,932 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-27 05:48:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 05:48:31,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:31,014 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:31,014 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-10-27 05:48:31,015 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [18], [20], [22], [32], [61], [63], [67], [71], [73], [118], [122], [125], [127], [129], [141], [151], [161], [170], [174], [182], [188], [194], [197], [199], [205], [209], [211], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:31,017 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:31,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:31,026 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:31,035 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:31,035 INFO L272 AbstractInterpreter]: Visited 23 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-10-27 05:48:31,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:31,079 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:31,113 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 82.49% of their original sizes. [2018-10-27 05:48:31,114 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:31,554 INFO L415 sIntCurrentIteration]: We unified 60 AI predicates to 60 [2018-10-27 05:48:31,554 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:31,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:31,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-10-27 05:48:31,555 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:31,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 05:48:31,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 05:48:31,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:48:31,555 INFO L87 Difference]: Start difference. First operand 259 states and 323 transitions. Second operand 9 states. [2018-10-27 05:48:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:32,335 INFO L93 Difference]: Finished difference Result 1166 states and 1496 transitions. [2018-10-27 05:48:32,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:48:32,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-10-27 05:48:32,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:32,338 INFO L225 Difference]: With dead ends: 1166 [2018-10-27 05:48:32,338 INFO L226 Difference]: Without dead ends: 998 [2018-10-27 05:48:32,339 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:48:32,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-10-27 05:48:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 253. [2018-10-27 05:48:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-27 05:48:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 315 transitions. [2018-10-27 05:48:32,363 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 315 transitions. Word has length 61 [2018-10-27 05:48:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:32,364 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 315 transitions. [2018-10-27 05:48:32,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 05:48:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 315 transitions. [2018-10-27 05:48:32,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-27 05:48:32,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:32,366 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, 1, 1, 1, 1, 1] [2018-10-27 05:48:32,366 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:32,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:32,366 INFO L82 PathProgramCache]: Analyzing trace with hash -481226266, now seen corresponding path program 1 times [2018-10-27 05:48:32,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:32,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:32,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:32,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:32,367 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:32,745 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-27 05:48:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 05:48:32,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:32,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:32,837 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-10-27 05:48:32,837 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [35], [37], [39], [42], [44], [46], [49], [51], [53], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [164], [170], [174], [182], [188], [194], [197], [199], [205], [209], [211], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:32,838 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:32,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:32,850 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:32,872 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:32,873 INFO L272 AbstractInterpreter]: Visited 30 different actions 30 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-10-27 05:48:32,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:32,908 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:32,956 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 75.23% of their original sizes. [2018-10-27 05:48:32,957 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:33,041 INFO L415 sIntCurrentIteration]: We unified 60 AI predicates to 60 [2018-10-27 05:48:33,041 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:33,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:33,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-10-27 05:48:33,041 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:33,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 05:48:33,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 05:48:33,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:48:33,042 INFO L87 Difference]: Start difference. First operand 253 states and 315 transitions. Second operand 10 states. [2018-10-27 05:48:33,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:33,668 INFO L93 Difference]: Finished difference Result 1129 states and 1453 transitions. [2018-10-27 05:48:33,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 05:48:33,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-10-27 05:48:33,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:33,671 INFO L225 Difference]: With dead ends: 1129 [2018-10-27 05:48:33,672 INFO L226 Difference]: Without dead ends: 962 [2018-10-27 05:48:33,672 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:48:33,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-10-27 05:48:33,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 240. [2018-10-27 05:48:33,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-27 05:48:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 300 transitions. [2018-10-27 05:48:33,693 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 300 transitions. Word has length 61 [2018-10-27 05:48:33,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:33,693 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 300 transitions. [2018-10-27 05:48:33,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 05:48:33,693 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 300 transitions. [2018-10-27 05:48:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-27 05:48:33,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:33,694 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, 1, 1, 1, 1, 1, 1] [2018-10-27 05:48:33,695 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:33,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:33,695 INFO L82 PathProgramCache]: Analyzing trace with hash 339951792, now seen corresponding path program 1 times [2018-10-27 05:48:33,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:33,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:33,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:33,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:33,696 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 05:48:33,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:33,772 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:33,772 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-10-27 05:48:33,772 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [122], [125], [127], [129], [141], [151], [161], [170], [174], [182], [188], [194], [197], [199], [205], [209], [211], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:33,773 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:33,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:33,782 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:33,801 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:33,801 INFO L272 AbstractInterpreter]: Visited 38 different actions 43 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-10-27 05:48:33,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:33,804 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:33,883 INFO L227 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 71.63% of their original sizes. [2018-10-27 05:48:33,883 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:34,060 INFO L415 sIntCurrentIteration]: We unified 61 AI predicates to 61 [2018-10-27 05:48:34,060 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:34,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:34,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-10-27 05:48:34,060 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:34,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 05:48:34,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 05:48:34,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:48:34,061 INFO L87 Difference]: Start difference. First operand 240 states and 300 transitions. Second operand 11 states. [2018-10-27 05:48:34,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:34,861 INFO L93 Difference]: Finished difference Result 995 states and 1273 transitions. [2018-10-27 05:48:34,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 05:48:34,861 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-10-27 05:48:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:34,863 INFO L225 Difference]: With dead ends: 995 [2018-10-27 05:48:34,863 INFO L226 Difference]: Without dead ends: 828 [2018-10-27 05:48:34,864 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:48:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2018-10-27 05:48:34,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 240. [2018-10-27 05:48:34,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-27 05:48:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 300 transitions. [2018-10-27 05:48:34,881 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 300 transitions. Word has length 62 [2018-10-27 05:48:34,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:34,881 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 300 transitions. [2018-10-27 05:48:34,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 05:48:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 300 transitions. [2018-10-27 05:48:34,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-27 05:48:34,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:34,882 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, 1, 1, 1, 1, 1, 1] [2018-10-27 05:48:34,882 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:34,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:34,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1592368213, now seen corresponding path program 1 times [2018-10-27 05:48:34,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:34,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:34,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:34,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:34,883 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 05:48:35,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:35,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:35,046 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-10-27 05:48:35,046 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [35], [37], [39], [58], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [122], [125], [127], [129], [141], [151], [161], [170], [174], [182], [188], [194], [197], [199], [205], [209], [211], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:35,047 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:35,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:35,053 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:35,068 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:48:35,068 INFO L272 AbstractInterpreter]: Visited 38 different actions 43 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-10-27 05:48:35,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:35,069 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:48:35,129 INFO L227 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 70.82% of their original sizes. [2018-10-27 05:48:35,129 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:48:35,347 INFO L415 sIntCurrentIteration]: We unified 61 AI predicates to 61 [2018-10-27 05:48:35,347 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:48:35,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:35,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-10-27 05:48:35,347 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:35,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 05:48:35,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 05:48:35,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:48:35,348 INFO L87 Difference]: Start difference. First operand 240 states and 300 transitions. Second operand 11 states. [2018-10-27 05:48:36,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:36,196 INFO L93 Difference]: Finished difference Result 1010 states and 1287 transitions. [2018-10-27 05:48:36,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 05:48:36,196 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-10-27 05:48:36,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:36,198 INFO L225 Difference]: With dead ends: 1010 [2018-10-27 05:48:36,198 INFO L226 Difference]: Without dead ends: 843 [2018-10-27 05:48:36,199 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:48:36,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-10-27 05:48:36,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 245. [2018-10-27 05:48:36,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-27 05:48:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 307 transitions. [2018-10-27 05:48:36,229 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 307 transitions. Word has length 62 [2018-10-27 05:48:36,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:36,229 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 307 transitions. [2018-10-27 05:48:36,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 05:48:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 307 transitions. [2018-10-27 05:48:36,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-27 05:48:36,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:36,230 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, 1, 1, 1, 1, 1, 1] [2018-10-27 05:48:36,231 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:36,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:36,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1899455193, now seen corresponding path program 1 times [2018-10-27 05:48:36,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:36,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:36,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:36,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:36,232 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 05:48:36,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:36,363 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:36,363 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-10-27 05:48:36,364 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [118], [122], [125], [127], [129], [141], [151], [161], [164], [168], [170], [174], [176], [180], [182], [188], [194], [197], [199], [205], [209], [211], [216], [222], [226], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:36,365 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:36,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:36,370 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:38,177 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 05:48:38,177 INFO L272 AbstractInterpreter]: Visited 54 different actions 1582 times. Merged at 43 different actions 1260 times. Widened at 2 different actions 38 times. Found 265 fixpoints after 14 different actions. Largest state had 22 variables. [2018-10-27 05:48:38,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:38,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 05:48:38,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:38,221 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/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-10-27 05:48:38,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:38,242 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:48:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:38,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:48:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 05:48:38,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:48:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 05:48:39,126 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:39,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 10 [2018-10-27 05:48:39,126 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:39,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:48:39,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:48:39,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:48:39,127 INFO L87 Difference]: Start difference. First operand 245 states and 307 transitions. Second operand 4 states. [2018-10-27 05:48:39,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:39,996 INFO L93 Difference]: Finished difference Result 484 states and 647 transitions. [2018-10-27 05:48:39,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:48:39,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-10-27 05:48:39,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:39,998 INFO L225 Difference]: With dead ends: 484 [2018-10-27 05:48:39,998 INFO L226 Difference]: Without dead ends: 317 [2018-10-27 05:48:39,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:48:39,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-27 05:48:40,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 291. [2018-10-27 05:48:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-27 05:48:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 359 transitions. [2018-10-27 05:48:40,028 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 359 transitions. Word has length 62 [2018-10-27 05:48:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:40,029 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 359 transitions. [2018-10-27 05:48:40,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:48:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 359 transitions. [2018-10-27 05:48:40,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-27 05:48:40,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:40,029 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:48:40,030 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:40,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:40,030 INFO L82 PathProgramCache]: Analyzing trace with hash -20052409, now seen corresponding path program 1 times [2018-10-27 05:48:40,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:40,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:40,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:40,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:40,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-27 05:48:40,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:40,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:48:40,175 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:40,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:48:40,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:48:40,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:48:40,176 INFO L87 Difference]: Start difference. First operand 291 states and 359 transitions. Second operand 3 states. [2018-10-27 05:48:40,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:40,245 INFO L93 Difference]: Finished difference Result 332 states and 406 transitions. [2018-10-27 05:48:40,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:48:40,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-10-27 05:48:40,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:40,248 INFO L225 Difference]: With dead ends: 332 [2018-10-27 05:48:40,248 INFO L226 Difference]: Without dead ends: 264 [2018-10-27 05:48:40,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:48:40,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-27 05:48:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 235. [2018-10-27 05:48:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-27 05:48:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 290 transitions. [2018-10-27 05:48:40,281 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 290 transitions. Word has length 70 [2018-10-27 05:48:40,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:40,282 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 290 transitions. [2018-10-27 05:48:40,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:48:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 290 transitions. [2018-10-27 05:48:40,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-27 05:48:40,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:40,283 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:48:40,283 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:40,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:40,288 INFO L82 PathProgramCache]: Analyzing trace with hash -999116813, now seen corresponding path program 1 times [2018-10-27 05:48:40,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:40,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:40,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:40,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:40,290 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 05:48:40,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:40,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:48:40,435 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:40,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:48:40,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:48:40,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:48:40,436 INFO L87 Difference]: Start difference. First operand 235 states and 290 transitions. Second operand 4 states. [2018-10-27 05:48:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:40,663 INFO L93 Difference]: Finished difference Result 534 states and 669 transitions. [2018-10-27 05:48:40,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:48:40,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-10-27 05:48:40,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:40,665 INFO L225 Difference]: With dead ends: 534 [2018-10-27 05:48:40,665 INFO L226 Difference]: Without dead ends: 377 [2018-10-27 05:48:40,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:48:40,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-27 05:48:40,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 292. [2018-10-27 05:48:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-27 05:48:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 371 transitions. [2018-10-27 05:48:40,708 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 371 transitions. Word has length 76 [2018-10-27 05:48:40,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:40,709 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 371 transitions. [2018-10-27 05:48:40,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:48:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 371 transitions. [2018-10-27 05:48:40,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-27 05:48:40,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:40,710 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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] [2018-10-27 05:48:40,710 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:40,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:40,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2028476111, now seen corresponding path program 2 times [2018-10-27 05:48:40,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:40,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:40,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:40,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:40,719 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 05:48:41,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:41,064 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:41,064 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:48:41,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:48:41,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:41,064 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/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-10-27 05:48:41,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:48:41,081 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:48:41,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 05:48:41,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:48:41,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:48:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-27 05:48:41,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:48:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-27 05:48:41,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:48:41,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2018-10-27 05:48:41,489 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:48:41,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:48:41,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:48:41,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:48:41,490 INFO L87 Difference]: Start difference. First operand 292 states and 371 transitions. Second operand 7 states. [2018-10-27 05:48:41,977 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-27 05:48:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:42,670 INFO L93 Difference]: Finished difference Result 985 states and 1273 transitions. [2018-10-27 05:48:42,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 05:48:42,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-10-27 05:48:42,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:42,673 INFO L225 Difference]: With dead ends: 985 [2018-10-27 05:48:42,673 INFO L226 Difference]: Without dead ends: 738 [2018-10-27 05:48:42,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-10-27 05:48:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-10-27 05:48:42,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 544. [2018-10-27 05:48:42,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-27 05:48:42,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 676 transitions. [2018-10-27 05:48:42,738 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 676 transitions. Word has length 76 [2018-10-27 05:48:42,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:42,738 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 676 transitions. [2018-10-27 05:48:42,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:48:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 676 transitions. [2018-10-27 05:48:42,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-27 05:48:42,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:42,743 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 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-10-27 05:48:42,743 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:42,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:42,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1131279850, now seen corresponding path program 1 times [2018-10-27 05:48:42,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:42,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:42,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:48:42,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:42,744 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:43,220 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-10-27 05:48:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 05:48:43,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:43,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 05:48:43,420 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:43,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 05:48:43,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 05:48:43,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:48:43,423 INFO L87 Difference]: Start difference. First operand 544 states and 676 transitions. Second operand 6 states. [2018-10-27 05:48:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:43,766 INFO L93 Difference]: Finished difference Result 1527 states and 1967 transitions. [2018-10-27 05:48:43,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:48:43,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-10-27 05:48:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:43,770 INFO L225 Difference]: With dead ends: 1527 [2018-10-27 05:48:43,770 INFO L226 Difference]: Without dead ends: 1093 [2018-10-27 05:48:43,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:48:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-10-27 05:48:43,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1025. [2018-10-27 05:48:43,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2018-10-27 05:48:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1296 transitions. [2018-10-27 05:48:43,906 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1296 transitions. Word has length 85 [2018-10-27 05:48:43,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:43,906 INFO L481 AbstractCegarLoop]: Abstraction has 1025 states and 1296 transitions. [2018-10-27 05:48:43,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 05:48:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1296 transitions. [2018-10-27 05:48:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-27 05:48:43,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:43,908 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 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-10-27 05:48:43,908 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:43,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:43,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1655626830, now seen corresponding path program 1 times [2018-10-27 05:48:43,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:43,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:43,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:43,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:43,909 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-27 05:48:43,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:43,994 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:43,994 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2018-10-27 05:48:43,995 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [85], [95], [99], [101], [103], [105], [115], [118], [122], [125], [127], [129], [141], [151], [161], [164], [168], [170], [174], [176], [180], [182], [186], [188], [192], [194], [197], [199], [205], [209], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:43,996 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:43,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:44,004 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:47,200 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 05:48:47,201 INFO L272 AbstractInterpreter]: Visited 56 different actions 2314 times. Merged at 42 different actions 1667 times. Widened at 2 different actions 50 times. Found 569 fixpoints after 19 different actions. Largest state had 22 variables. [2018-10-27 05:48:47,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:47,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 05:48:47,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:47,239 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 05:48:47,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:47,252 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:48:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:47,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:48:47,796 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 05:48:47,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:48:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 05:48:49,088 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:48:49,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 11 [2018-10-27 05:48:49,088 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:48:49,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:48:49,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:48:49,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=85, Unknown=1, NotChecked=0, Total=110 [2018-10-27 05:48:49,089 INFO L87 Difference]: Start difference. First operand 1025 states and 1296 transitions. Second operand 5 states. [2018-10-27 05:48:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:55,718 INFO L93 Difference]: Finished difference Result 1946 states and 2451 transitions. [2018-10-27 05:48:55,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 05:48:55,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-10-27 05:48:55,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:55,722 INFO L225 Difference]: With dead ends: 1946 [2018-10-27 05:48:55,722 INFO L226 Difference]: Without dead ends: 1393 [2018-10-27 05:48:55,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2018-10-27 05:48:55,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2018-10-27 05:48:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1181. [2018-10-27 05:48:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2018-10-27 05:48:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1498 transitions. [2018-10-27 05:48:55,867 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1498 transitions. Word has length 85 [2018-10-27 05:48:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:55,868 INFO L481 AbstractCegarLoop]: Abstraction has 1181 states and 1498 transitions. [2018-10-27 05:48:55,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:48:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1498 transitions. [2018-10-27 05:48:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 05:48:55,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:55,870 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:48:55,870 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:55,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:55,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1427970850, now seen corresponding path program 1 times [2018-10-27 05:48:55,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:48:55,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:55,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:55,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:55,871 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:48:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:55,962 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-27 05:48:55,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:55,962 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:48:55,962 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 92 with the following transitions: [2018-10-27 05:48:55,962 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [118], [122], [125], [127], [129], [131], [135], [137], [139], [141], [145], [147], [149], [151], [161], [164], [168], [170], [174], [176], [180], [182], [186], [188], [192], [194], [197], [199], [205], [209], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:48:55,963 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:48:55,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:48:55,969 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:48:58,539 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 05:48:58,539 INFO L272 AbstractInterpreter]: Visited 59 different actions 2765 times. Merged at 45 different actions 1896 times. Widened at 2 different actions 50 times. Found 785 fixpoints after 21 different actions. Largest state had 22 variables. [2018-10-27 05:48:58,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:58,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 05:48:58,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:48:58,547 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/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-10-27 05:48:58,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:58,557 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:48:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:58,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:48:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 28 proven. 52 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 05:48:58,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:48:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-27 05:48:58,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:48:58,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2018-10-27 05:48:58,898 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:48:58,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:48:58,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:48:58,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:48:58,899 INFO L87 Difference]: Start difference. First operand 1181 states and 1498 transitions. Second operand 7 states. [2018-10-27 05:49:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:49:00,214 INFO L93 Difference]: Finished difference Result 3311 states and 4026 transitions. [2018-10-27 05:49:00,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 05:49:00,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-10-27 05:49:00,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:49:00,221 INFO L225 Difference]: With dead ends: 3311 [2018-10-27 05:49:00,221 INFO L226 Difference]: Without dead ends: 3280 [2018-10-27 05:49:00,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2018-10-27 05:49:00,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2018-10-27 05:49:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 1570. [2018-10-27 05:49:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2018-10-27 05:49:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2116 transitions. [2018-10-27 05:49:00,370 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2116 transitions. Word has length 91 [2018-10-27 05:49:00,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:49:00,370 INFO L481 AbstractCegarLoop]: Abstraction has 1570 states and 2116 transitions. [2018-10-27 05:49:00,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:49:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2116 transitions. [2018-10-27 05:49:00,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 05:49:00,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:49:00,375 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:49:00,375 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:49:00,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:49:00,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1957572388, now seen corresponding path program 1 times [2018-10-27 05:49:00,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:49:00,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:49:00,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:49:00,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:49:00,376 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:49:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:49:00,884 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 14 [2018-10-27 05:49:01,104 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2018-10-27 05:49:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-27 05:49:01,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:49:01,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 05:49:01,279 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:49:01,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:49:01,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:49:01,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:49:01,280 INFO L87 Difference]: Start difference. First operand 1570 states and 2116 transitions. Second operand 7 states. [2018-10-27 05:49:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:49:01,736 INFO L93 Difference]: Finished difference Result 3546 states and 4795 transitions. [2018-10-27 05:49:01,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 05:49:01,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-10-27 05:49:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:49:01,741 INFO L225 Difference]: With dead ends: 3546 [2018-10-27 05:49:01,742 INFO L226 Difference]: Without dead ends: 2008 [2018-10-27 05:49:01,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-10-27 05:49:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2018-10-27 05:49:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1735. [2018-10-27 05:49:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-10-27 05:49:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2320 transitions. [2018-10-27 05:49:01,924 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2320 transitions. Word has length 91 [2018-10-27 05:49:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:49:01,924 INFO L481 AbstractCegarLoop]: Abstraction has 1735 states and 2320 transitions. [2018-10-27 05:49:01,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:49:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2320 transitions. [2018-10-27 05:49:01,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-27 05:49:01,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:49:01,926 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:49:01,926 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:49:01,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:49:01,927 INFO L82 PathProgramCache]: Analyzing trace with hash 531210933, now seen corresponding path program 1 times [2018-10-27 05:49:01,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:49:01,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:49:01,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:49:01,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:49:01,936 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:49:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:49:02,443 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-27 05:49:02,823 WARN L179 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-10-27 05:49:03,111 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 14 [2018-10-27 05:49:03,119 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 57 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-27 05:49:03,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:49:03,119 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:49:03,120 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2018-10-27 05:49:03,120 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [85], [89], [91], [93], [95], [99], [101], [103], [105], [109], [111], [113], [115], [122], [125], [127], [129], [141], [151], [161], [164], [168], [170], [174], [176], [180], [182], [186], [188], [192], [194], [197], [199], [205], [209], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:49:03,121 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:49:03,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:49:03,127 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:49:06,031 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 05:49:06,031 INFO L272 AbstractInterpreter]: Visited 58 different actions 3310 times. Merged at 47 different actions 2347 times. Widened at 2 different actions 44 times. Found 872 fixpoints after 24 different actions. Largest state had 22 variables. [2018-10-27 05:49:06,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:49:06,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 05:49:06,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:49:06,039 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:49:06,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:49:06,047 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:49:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:49:06,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:49:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 05:49:06,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:49:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 05:49:06,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:49:06,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2018-10-27 05:49:06,275 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:49:06,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:49:06,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:49:06,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-10-27 05:49:06,276 INFO L87 Difference]: Start difference. First operand 1735 states and 2320 transitions. Second operand 5 states. [2018-10-27 05:49:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:49:07,388 INFO L93 Difference]: Finished difference Result 2550 states and 3383 transitions. [2018-10-27 05:49:07,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:49:07,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-10-27 05:49:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:49:07,395 INFO L225 Difference]: With dead ends: 2550 [2018-10-27 05:49:07,395 INFO L226 Difference]: Without dead ends: 2309 [2018-10-27 05:49:07,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-10-27 05:49:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2018-10-27 05:49:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2260. [2018-10-27 05:49:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2018-10-27 05:49:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 3002 transitions. [2018-10-27 05:49:07,762 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 3002 transitions. Word has length 94 [2018-10-27 05:49:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:49:07,762 INFO L481 AbstractCegarLoop]: Abstraction has 2260 states and 3002 transitions. [2018-10-27 05:49:07,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:49:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 3002 transitions. [2018-10-27 05:49:07,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-27 05:49:07,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:49:07,769 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:49:07,769 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:49:07,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:49:07,769 INFO L82 PathProgramCache]: Analyzing trace with hash 790008164, now seen corresponding path program 1 times [2018-10-27 05:49:07,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:49:07,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:49:07,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:49:07,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:49:07,770 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:49:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:49:08,266 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 55 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-27 05:49:08,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:49:08,266 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:49:08,267 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2018-10-27 05:49:08,267 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [118], [122], [125], [127], [129], [131], [135], [137], [139], [141], [145], [147], [149], [151], [155], [157], [159], [161], [168], [170], [174], [176], [180], [182], [186], [188], [192], [194], [197], [199], [205], [209], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:49:08,268 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:49:08,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:49:08,274 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:49:10,647 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 05:49:10,647 INFO L272 AbstractInterpreter]: Visited 61 different actions 2990 times. Merged at 47 different actions 2058 times. Widened at 2 different actions 50 times. Found 835 fixpoints after 22 different actions. Largest state had 22 variables. [2018-10-27 05:49:10,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:49:10,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 05:49:10,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:49:10,652 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:49:10,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:49:10,662 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:49:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:49:10,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:49:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 05:49:10,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:49:11,025 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 76 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 05:49:11,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:49:11,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 8] total 18 [2018-10-27 05:49:11,044 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:49:11,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 05:49:11,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 05:49:11,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-10-27 05:49:11,045 INFO L87 Difference]: Start difference. First operand 2260 states and 3002 transitions. Second operand 12 states. [2018-10-27 05:49:24,140 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((v_mp_add_~na~0_23 Int)) (and (<= v_mp_add_~na~0_23 4) (= (+ c_mp_add_~na~0 1) (mod v_mp_add_~na~0_23 256)) (<= 4 v_mp_add_~na~0_23))) (<= (+ c_mp_add_~na~0 (* 256 (div (+ c_mp_add_~i~0 (+ (- c_mp_add_~na~0) 258)) 256))) (+ c_mp_add_~i~0 3)) (= 4 c_mp_add_~nb~0) (exists ((v_mp_add_~na~0_23 Int)) (and (<= (mod (+ (mod v_mp_add_~na~0_23 256) 255) 256) (mod c_mp_add_~i~0 256)) (<= v_mp_add_~na~0_23 4) (<= 4 v_mp_add_~na~0_23)))) is different from false [2018-10-27 05:49:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:49:24,290 INFO L93 Difference]: Finished difference Result 5469 states and 7420 transitions. [2018-10-27 05:49:24,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 05:49:24,291 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2018-10-27 05:49:24,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:49:24,296 INFO L225 Difference]: With dead ends: 5469 [2018-10-27 05:49:24,296 INFO L226 Difference]: Without dead ends: 3257 [2018-10-27 05:49:24,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=149, Invalid=404, Unknown=3, NotChecked=44, Total=600 [2018-10-27 05:49:24,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2018-10-27 05:49:24,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 2922. [2018-10-27 05:49:24,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2922 states. [2018-10-27 05:49:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3801 transitions. [2018-10-27 05:49:24,546 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3801 transitions. Word has length 97 [2018-10-27 05:49:24,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:49:24,546 INFO L481 AbstractCegarLoop]: Abstraction has 2922 states and 3801 transitions. [2018-10-27 05:49:24,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 05:49:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3801 transitions. [2018-10-27 05:49:24,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-27 05:49:24,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:49:24,548 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:49:24,548 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:49:24,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:49:24,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1274084595, now seen corresponding path program 1 times [2018-10-27 05:49:24,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:49:24,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:49:24,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:49:24,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:49:24,549 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:49:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:49:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 57 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-27 05:49:25,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:49:25,136 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:49:25,136 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2018-10-27 05:49:25,136 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [35], [37], [39], [58], [63], [67], [71], [73], [76], [79], [81], [83], [85], [89], [91], [93], [95], [99], [101], [103], [105], [109], [111], [113], [115], [122], [125], [127], [129], [141], [151], [161], [164], [168], [170], [174], [176], [180], [182], [186], [188], [192], [194], [197], [199], [205], [209], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:49:25,138 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:49:25,138 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:49:25,150 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:49:28,000 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 05:49:28,000 INFO L272 AbstractInterpreter]: Visited 61 different actions 3816 times. Merged at 47 different actions 2712 times. Widened at 2 different actions 50 times. Found 1010 fixpoints after 24 different actions. Largest state had 22 variables. [2018-10-27 05:49:28,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:49:28,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 05:49:28,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:49:28,011 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:49:28,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:49:28,021 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:49:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:49:28,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:49:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 05:49:28,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:49:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 73 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-27 05:49:28,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:49:28,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 7] total 18 [2018-10-27 05:49:28,754 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:49:28,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 05:49:28,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 05:49:28,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-10-27 05:49:28,755 INFO L87 Difference]: Start difference. First operand 2922 states and 3801 transitions. Second operand 6 states. [2018-10-27 05:49:30,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:49:30,389 INFO L93 Difference]: Finished difference Result 3783 states and 4920 transitions. [2018-10-27 05:49:30,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 05:49:30,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-10-27 05:49:30,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:49:30,397 INFO L225 Difference]: With dead ends: 3783 [2018-10-27 05:49:30,398 INFO L226 Difference]: Without dead ends: 3526 [2018-10-27 05:49:30,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-10-27 05:49:30,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3526 states. [2018-10-27 05:49:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3526 to 2888. [2018-10-27 05:49:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2018-10-27 05:49:30,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 3766 transitions. [2018-10-27 05:49:30,825 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 3766 transitions. Word has length 97 [2018-10-27 05:49:30,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:49:30,825 INFO L481 AbstractCegarLoop]: Abstraction has 2888 states and 3766 transitions. [2018-10-27 05:49:30,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 05:49:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3766 transitions. [2018-10-27 05:49:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-27 05:49:30,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:49:30,827 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:49:30,827 INFO L424 AbstractCegarLoop]: === Iteration 37 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:49:30,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:49:30,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1735884316, now seen corresponding path program 1 times [2018-10-27 05:49:30,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:49:30,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:49:30,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:49:30,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:49:30,829 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:49:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:49:31,521 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 55 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-27 05:49:31,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:49:31,521 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:49:31,521 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2018-10-27 05:49:31,521 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [24], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [118], [122], [125], [127], [129], [131], [135], [137], [139], [141], [145], [147], [149], [151], [155], [157], [159], [161], [168], [170], [174], [176], [180], [182], [186], [188], [192], [194], [197], [199], [205], [209], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:49:31,522 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:49:31,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:49:31,528 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:49:33,614 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 05:49:33,615 INFO L272 AbstractInterpreter]: Visited 64 different actions 2767 times. Merged at 47 different actions 1900 times. Widened at 2 different actions 46 times. Found 767 fixpoints after 22 different actions. Largest state had 22 variables. [2018-10-27 05:49:33,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:49:33,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 05:49:33,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:49:33,623 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:49:33,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:49:33,632 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:49:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:49:33,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:49:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 05:49:33,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:49:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 70 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 05:49:35,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:49:35,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 10] total 22 [2018-10-27 05:49:35,382 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:49:35,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 05:49:35,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 05:49:35,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-10-27 05:49:35,383 INFO L87 Difference]: Start difference. First operand 2888 states and 3766 transitions. Second operand 14 states. [2018-10-27 05:50:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:50:31,487 INFO L93 Difference]: Finished difference Result 5376 states and 6958 transitions. [2018-10-27 05:50:31,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 05:50:31,488 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 100 [2018-10-27 05:50:31,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:50:31,501 INFO L225 Difference]: With dead ends: 5376 [2018-10-27 05:50:31,502 INFO L226 Difference]: Without dead ends: 4889 [2018-10-27 05:50:31,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 187 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=214, Invalid=650, Unknown=6, NotChecked=0, Total=870 [2018-10-27 05:50:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4889 states. [2018-10-27 05:50:31,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4889 to 3425. [2018-10-27 05:50:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3425 states. [2018-10-27 05:50:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 4428 transitions. [2018-10-27 05:50:31,866 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 4428 transitions. Word has length 100 [2018-10-27 05:50:31,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:50:31,866 INFO L481 AbstractCegarLoop]: Abstraction has 3425 states and 4428 transitions. [2018-10-27 05:50:31,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 05:50:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 4428 transitions. [2018-10-27 05:50:31,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-27 05:50:31,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:50:31,869 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:50:31,870 INFO L424 AbstractCegarLoop]: === Iteration 38 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:50:31,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:50:31,870 INFO L82 PathProgramCache]: Analyzing trace with hash 704222458, now seen corresponding path program 1 times [2018-10-27 05:50:31,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:50:31,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:31,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:50:31,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:31,871 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:50:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:50:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 35 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-27 05:50:32,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:50:32,411 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:50:32,411 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2018-10-27 05:50:32,411 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [35], [37], [39], [58], [63], [67], [71], [73], [76], [79], [81], [83], [85], [89], [91], [93], [95], [99], [101], [103], [105], [109], [111], [113], [115], [122], [125], [127], [129], [141], [151], [161], [164], [168], [170], [174], [176], [180], [182], [186], [188], [192], [194], [197], [199], [205], [209], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:50:32,412 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:50:32,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:50:32,417 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:50:34,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 05:50:34,629 INFO L272 AbstractInterpreter]: Visited 64 different actions 3103 times. Merged at 47 different actions 2195 times. Widened at 2 different actions 40 times. Found 811 fixpoints after 24 different actions. Largest state had 22 variables. [2018-10-27 05:50:34,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:50:34,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 05:50:34,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:50:34,635 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:50:34,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:50:34,645 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:50:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:50:34,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:50:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 05:50:34,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:50:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 05:50:35,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:50:35,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 17 [2018-10-27 05:50:35,309 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:50:35,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:50:35,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:50:35,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-10-27 05:50:35,310 INFO L87 Difference]: Start difference. First operand 3425 states and 4428 transitions. Second operand 7 states. [2018-10-27 05:50:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:50:35,977 INFO L93 Difference]: Finished difference Result 5317 states and 6898 transitions. [2018-10-27 05:50:35,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 05:50:35,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-10-27 05:50:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:50:35,984 INFO L225 Difference]: With dead ends: 5317 [2018-10-27 05:50:35,984 INFO L226 Difference]: Without dead ends: 5033 [2018-10-27 05:50:35,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 191 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-10-27 05:50:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5033 states. [2018-10-27 05:50:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5033 to 4060. [2018-10-27 05:50:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2018-10-27 05:50:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 5252 transitions. [2018-10-27 05:50:36,439 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 5252 transitions. Word has length 100 [2018-10-27 05:50:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:50:36,439 INFO L481 AbstractCegarLoop]: Abstraction has 4060 states and 5252 transitions. [2018-10-27 05:50:36,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:50:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 5252 transitions. [2018-10-27 05:50:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-27 05:50:36,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:50:36,441 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:50:36,441 INFO L424 AbstractCegarLoop]: === Iteration 39 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:50:36,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:50:36,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1379502856, now seen corresponding path program 1 times [2018-10-27 05:50:36,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:50:36,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:36,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:50:36,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:36,442 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:50:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:50:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-27 05:50:36,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:50:36,716 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:50:36,717 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2018-10-27 05:50:36,717 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [35], [37], [39], [42], [44], [46], [55], [63], [67], [71], [73], [76], [79], [81], [83], [85], [89], [91], [93], [95], [99], [101], [103], [105], [109], [111], [113], [115], [122], [125], [127], [129], [141], [151], [161], [164], [168], [170], [174], [176], [180], [182], [186], [188], [192], [194], [197], [199], [205], [209], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:50:36,718 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:50:36,718 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:50:36,725 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:50:39,197 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 05:50:39,197 INFO L272 AbstractInterpreter]: Visited 64 different actions 3486 times. Merged at 47 different actions 2469 times. Widened at 2 different actions 46 times. Found 920 fixpoints after 24 different actions. Largest state had 22 variables. [2018-10-27 05:50:39,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:50:39,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 05:50:39,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:50:39,207 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:50:39,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:50:39,217 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:50:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:50:39,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:50:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 05:50:39,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:50:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 05:50:39,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:50:39,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 21 [2018-10-27 05:50:39,950 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:50:39,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:50:39,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:50:39,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-10-27 05:50:39,951 INFO L87 Difference]: Start difference. First operand 4060 states and 5252 transitions. Second operand 7 states. [2018-10-27 05:50:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:50:40,505 INFO L93 Difference]: Finished difference Result 5516 states and 7132 transitions. [2018-10-27 05:50:40,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 05:50:40,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-10-27 05:50:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:50:40,510 INFO L225 Difference]: With dead ends: 5516 [2018-10-27 05:50:40,511 INFO L226 Difference]: Without dead ends: 5264 [2018-10-27 05:50:40,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-10-27 05:50:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5264 states. [2018-10-27 05:50:40,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5264 to 4060. [2018-10-27 05:50:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2018-10-27 05:50:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 5252 transitions. [2018-10-27 05:50:40,843 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 5252 transitions. Word has length 100 [2018-10-27 05:50:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:50:40,843 INFO L481 AbstractCegarLoop]: Abstraction has 4060 states and 5252 transitions. [2018-10-27 05:50:40,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:50:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 5252 transitions. [2018-10-27 05:50:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-27 05:50:40,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:50:40,845 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2018-10-27 05:50:40,845 INFO L424 AbstractCegarLoop]: === Iteration 40 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:50:40,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:50:40,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1840758149, now seen corresponding path program 1 times [2018-10-27 05:50:40,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:50:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:40,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:50:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:40,846 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:50:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:50:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 05:50:41,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:50:41,176 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:50:41,177 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2018-10-27 05:50:41,177 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [85], [89], [91], [93], [95], [99], [101], [103], [105], [109], [111], [113], [115], [122], [125], [127], [129], [131], [135], [137], [139], [141], [151], [161], [164], [168], [170], [174], [176], [180], [182], [186], [188], [192], [194], [197], [199], [205], [209], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-10-27 05:50:41,178 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:50:41,178 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:50:41,184 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 05:50:44,360 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 05:50:44,360 INFO L272 AbstractInterpreter]: Visited 62 different actions 3989 times. Merged at 51 different actions 2748 times. Widened at 2 different actions 44 times. Found 1146 fixpoints after 28 different actions. Largest state had 22 variables. [2018-10-27 05:50:44,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:50:44,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 05:50:44,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:50:44,367 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06765c0b-ce14-43ee-8957-224891d1ff48/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:50:44,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:50:44,376 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:50:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:50:44,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:50:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 05:50:44,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:50:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 55 proven. 16 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 05:50:44,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:50:44,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2018-10-27 05:50:44,671 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:50:44,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:50:44,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:50:44,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-10-27 05:50:44,672 INFO L87 Difference]: Start difference. First operand 4060 states and 5252 transitions. Second operand 5 states. [2018-10-27 05:50:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:50:45,102 INFO L93 Difference]: Finished difference Result 5121 states and 6609 transitions. [2018-10-27 05:50:45,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:50:45,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-10-27 05:50:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:50:45,107 INFO L225 Difference]: With dead ends: 5121 [2018-10-27 05:50:45,107 INFO L226 Difference]: Without dead ends: 4495 [2018-10-27 05:50:45,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-10-27 05:50:45,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2018-10-27 05:50:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 4459. [2018-10-27 05:50:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4459 states. [2018-10-27 05:50:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4459 states to 4459 states and 5765 transitions. [2018-10-27 05:50:45,424 INFO L78 Accepts]: Start accepts. Automaton has 4459 states and 5765 transitions. Word has length 100 [2018-10-27 05:50:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:50:45,424 INFO L481 AbstractCegarLoop]: Abstraction has 4459 states and 5765 transitions. [2018-10-27 05:50:45,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:50:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 4459 states and 5765 transitions. [2018-10-27 05:50:45,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-27 05:50:45,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:50:45,427 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:50:45,427 INFO L424 AbstractCegarLoop]: === Iteration 41 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:50:45,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:50:45,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1388279840, now seen corresponding path program 1 times [2018-10-27 05:50:45,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:50:45,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:45,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:50:45,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:45,428 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:50:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 05:50:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 05:50:45,483 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-27 05:50:45,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:50:45 BoogieIcfgContainer [2018-10-27 05:50:45,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 05:50:45,540 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 05:50:45,540 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 05:50:45,541 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 05:50:45,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:48:00" (3/4) ... [2018-10-27 05:50:45,544 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 05:50:45,544 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 05:50:45,545 INFO L168 Benchmark]: Toolchain (without parser) took 166855.77 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 954.8 MB in the beginning and 1.2 GB in the end (delta: -284.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-10-27 05:50:45,545 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:50:45,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.69 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 941.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-10-27 05:50:45,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.76 ms. Allocated memory is still 1.0 GB. Free memory is still 941.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:50:45,546 INFO L168 Benchmark]: Boogie Preprocessor took 36.10 ms. Allocated memory is still 1.0 GB. Free memory was 941.4 MB in the beginning and 938.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 05:50:45,546 INFO L168 Benchmark]: RCFGBuilder took 1005.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-10-27 05:50:45,546 INFO L168 Benchmark]: TraceAbstraction took 165530.48 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -136.5 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-10-27 05:50:45,547 INFO L168 Benchmark]: Witness Printer took 3.91 ms. Allocated memory is still 3.8 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:50:45,561 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.69 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 941.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.76 ms. Allocated memory is still 1.0 GB. Free memory is still 941.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.10 ms. Allocated memory is still 1.0 GB. Free memory was 941.4 MB in the beginning and 938.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1005.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 165530.48 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -136.5 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 3.91 ms. Allocated memory is still 3.8 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 77. Possible FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L110] CALL mp_add(a, b) VAL [\old(a)=0, \old(b)=2147483647] [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)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=4] [L40] COND TRUE a3 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=4] [L41] EXPR na - 1 [L41] na = na - 1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=3] [L42] COND TRUE a2 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=3] [L43] EXPR na - 1 [L43] na = na - 1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=2] [L44] COND TRUE a1 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=2] [L45] EXPR na - 1 [L45] na = na - 1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1] [L49] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1, nb=4] [L50] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1, nb=4] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, 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)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L65] EXPR partial_sum + a0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L71] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=1, r0=1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L64] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L72] COND TRUE i == (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=1] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=1] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=1] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, r0=1] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, r0=1] [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=1, 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)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L64] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L73] COND TRUE i == (unsigned char)2 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=1, r1=0] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=1, r1=0] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=1, r1=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=1, r1=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=1, r1=0] [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=1, r1=0, r2=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=1, r1=0, r2=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=3, na=1, nb=4, partial_sum=0, r0=1, 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)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L64] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L74] COND TRUE i == (unsigned char)3 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L76] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L97] r1 << 8U VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L97] r2 << 16U VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L97] r3 << 24U VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 128 locations, 38 error locations. UNSAFE Result, 165.4s OverallTime, 41 OverallIterations, 5 TraceHistogramMax, 111.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8212 SDtfs, 12568 SDslu, 24710 SDs, 0 SdLazy, 9568 SolverSat, 552 SolverUnsat, 40 SolverUnknown, 0 SolverNotchecked, 66.8s Time, PredicateUnifierStatistics: 36 DeclaredPredicates, 3229 GetRequests, 2855 SyntacticMatches, 24 SemanticMatches, 350 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 34.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4459occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 26.7s AbstIntTime, 28 AbstIntIterations, 18 AbstIntStrong, 0.9738289296909998 AbsIntWeakeningRatio, 0.5586206896551724 AbsIntAvgWeakeningVarsNumRemoved, 5.56551724137931 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 40 MinimizatonAttempts, 21054 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 3701 NumberOfCodeBlocks, 3656 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 4539 ConstructedInterpolants, 591 QuantifiedInterpolants, 2436168 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1994 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 62 InterpolantComputations, 20 PerfectInterpolantSequences, 3196/3584 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...