./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_10333b72-1af1-4b5f-a576-62d7763730ef/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_10333b72-1af1-4b5f-a576-62d7763730ef/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_10333b72-1af1-4b5f-a576-62d7763730ef/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_10333b72-1af1-4b5f-a576-62d7763730ef/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_10333b72-1af1-4b5f-a576-62d7763730ef/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_10333b72-1af1-4b5f-a576-62d7763730ef/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 64bit --witnessprinter.graph.data.programhash 932d0be5444dce6d8d9a378b61966d0cdf64a5cb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 05:50:57,501 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 05:50:57,504 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 05:50:57,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 05:50:57,517 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 05:50:57,518 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 05:50:57,520 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 05:50:57,521 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 05:50:57,522 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 05:50:57,522 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 05:50:57,523 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 05:50:57,523 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 05:50:57,524 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 05:50:57,525 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 05:50:57,525 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 05:50:57,526 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 05:50:57,527 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 05:50:57,529 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 05:50:57,530 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 05:50:57,531 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 05:50:57,532 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 05:50:57,533 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 05:50:57,535 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 05:50:57,536 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 05:50:57,536 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 05:50:57,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 05:50:57,537 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 05:50:57,538 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 05:50:57,539 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 05:50:57,540 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 05:50:57,540 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 05:50:57,541 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 05:50:57,541 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 05:50:57,541 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 05:50:57,542 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 05:50:57,543 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 05:50:57,544 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_10333b72-1af1-4b5f-a576-62d7763730ef/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-10-27 05:50:57,555 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 05:50:57,555 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 05:50:57,555 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 05:50:57,556 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 05:50:57,556 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 05:50:57,556 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 05:50:57,556 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 05:50:57,556 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 05:50:57,557 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 05:50:57,557 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 05:50:57,557 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 05:50:57,557 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 05:50:57,558 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 05:50:57,558 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 05:50:57,558 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 05:50:57,558 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 05:50:57,558 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 05:50:57,560 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 05:50:57,560 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-10-27 05:50:57,560 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 05:50:57,560 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 05:50:57,561 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 05:50:57,561 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 05:50:57,561 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 05:50:57,561 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 05:50:57,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 05:50:57,561 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 05:50:57,561 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 05:50:57,562 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 05:50:57,562 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 05:50:57,562 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 05:50:57,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 05:50:57,562 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 05:50:57,562 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_10333b72-1af1-4b5f-a576-62d7763730ef/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 932d0be5444dce6d8d9a378b61966d0cdf64a5cb [2018-10-27 05:50:57,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 05:50:57,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 05:50:57,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 05:50:57,602 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 05:50:57,603 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 05:50:57,603 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_10333b72-1af1-4b5f-a576-62d7763730ef/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c [2018-10-27 05:50:57,655 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_10333b72-1af1-4b5f-a576-62d7763730ef/bin-2019/utaipan/data/abf18b71a/9c792df8414b47e2a259ec298bf3d508/FLAGf99266d69 [2018-10-27 05:50:58,036 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 05:50:58,037 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_10333b72-1af1-4b5f-a576-62d7763730ef/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c [2018-10-27 05:50:58,042 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_10333b72-1af1-4b5f-a576-62d7763730ef/bin-2019/utaipan/data/abf18b71a/9c792df8414b47e2a259ec298bf3d508/FLAGf99266d69 [2018-10-27 05:50:58,053 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_10333b72-1af1-4b5f-a576-62d7763730ef/bin-2019/utaipan/data/abf18b71a/9c792df8414b47e2a259ec298bf3d508 [2018-10-27 05:50:58,056 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 05:50:58,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 05:50:58,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 05:50:58,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 05:50:58,061 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 05:50:58,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:50:58" (1/1) ... [2018-10-27 05:50:58,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381fc8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:50:58, skipping insertion in model container [2018-10-27 05:50:58,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:50:58" (1/1) ... [2018-10-27 05:50:58,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 05:50:58,088 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 05:50:58,199 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:50:58,202 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 05:50:58,213 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:50:58,223 INFO L193 MainTranslator]: Completed translation [2018-10-27 05:50:58,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:50:58 WrapperNode [2018-10-27 05:50:58,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 05:50:58,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 05:50:58,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 05:50:58,224 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 05:50:58,231 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:50:58" (1/1) ... [2018-10-27 05:50:58,236 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:50:58" (1/1) ... [2018-10-27 05:50:58,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 05:50:58,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 05:50:58,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 05:50:58,243 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 05:50:58,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:50:58" (1/1) ... [2018-10-27 05:50:58,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:50:58" (1/1) ... [2018-10-27 05:50:58,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:50:58" (1/1) ... [2018-10-27 05:50:58,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:50:58" (1/1) ... [2018-10-27 05:50:58,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:50:58" (1/1) ... [2018-10-27 05:50:58,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:50:58" (1/1) ... [2018-10-27 05:50:58,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:50:58" (1/1) ... [2018-10-27 05:50:58,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 05:50:58,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 05:50:58,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 05:50:58,262 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 05:50:58,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:50:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10333b72-1af1-4b5f-a576-62d7763730ef/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:50:58,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 05:50:58,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 05:50:58,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 05:50:58,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 05:50:58,409 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 05:50:58,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 05:50:58,776 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 05:50:58,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:50:58 BoogieIcfgContainer [2018-10-27 05:50:58,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 05:50:58,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 05:50:58,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 05:50:58,782 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 05:50:58,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:50:58" (1/3) ... [2018-10-27 05:50:58,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b74d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:50:58, skipping insertion in model container [2018-10-27 05:50:58,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:50:58" (2/3) ... [2018-10-27 05:50:58,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b74d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:50:58, skipping insertion in model container [2018-10-27 05:50:58,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:50:58" (3/3) ... [2018-10-27 05:50:58,785 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c [2018-10-27 05:50:58,797 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 05:50:58,805 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-10-27 05:50:58,815 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-10-27 05:50:58,843 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 05:50:58,844 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 05:50:58,844 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 05:50:58,844 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 05:50:58,844 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 05:50:58,844 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 05:50:58,844 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 05:50:58,844 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 05:50:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-10-27 05:50:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-27 05:50:58,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:50:58,866 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:50:58,868 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:50:58,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:50:58,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1007353508, now seen corresponding path program 1 times [2018-10-27 05:50:58,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:50:58,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:58,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:50:58,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:58,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:50:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:50:59,031 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:50:59,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:50:59,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:50:59,033 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:50:59,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:50:59,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:50:59,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:50:59,052 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-10-27 05:50:59,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:50:59,170 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-10-27 05:50:59,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:50:59,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-27 05:50:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:50:59,182 INFO L225 Difference]: With dead ends: 50 [2018-10-27 05:50:59,182 INFO L226 Difference]: Without dead ends: 36 [2018-10-27 05:50:59,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:50:59,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-27 05:50:59,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-10-27 05:50:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 05:50:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-10-27 05:50:59,218 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 8 [2018-10-27 05:50:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:50:59,218 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 05:50:59,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:50:59,219 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-10-27 05:50:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-27 05:50:59,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:50:59,220 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:50:59,220 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:50:59,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:50:59,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1163187724, now seen corresponding path program 1 times [2018-10-27 05:50:59,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:50:59,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:59,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:50:59,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:59,222 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:50:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:50:59,255 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:50:59,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:50:59,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:50:59,256 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:50:59,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:50:59,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:50:59,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:50:59,258 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 3 states. [2018-10-27 05:50:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:50:59,299 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-10-27 05:50:59,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:50:59,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-27 05:50:59,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:50:59,301 INFO L225 Difference]: With dead ends: 35 [2018-10-27 05:50:59,301 INFO L226 Difference]: Without dead ends: 34 [2018-10-27 05:50:59,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:50:59,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-27 05:50:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-27 05:50:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-27 05:50:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-10-27 05:50:59,306 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 9 [2018-10-27 05:50:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:50:59,306 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-10-27 05:50:59,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:50:59,307 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-10-27 05:50:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-27 05:50:59,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:50:59,307 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:50:59,308 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:50:59,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:50:59,308 INFO L82 PathProgramCache]: Analyzing trace with hash 729392297, now seen corresponding path program 1 times [2018-10-27 05:50:59,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:50:59,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:59,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:50:59,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:59,310 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:50:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:50:59,348 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:50:59,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:50:59,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:50:59,349 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:50:59,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:50:59,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:50:59,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:50:59,350 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2018-10-27 05:50:59,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:50:59,427 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2018-10-27 05:50:59,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:50:59,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-27 05:50:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:50:59,429 INFO L225 Difference]: With dead ends: 58 [2018-10-27 05:50:59,429 INFO L226 Difference]: Without dead ends: 56 [2018-10-27 05:50:59,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:50:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-27 05:50:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-10-27 05:50:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-27 05:50:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2018-10-27 05:50:59,435 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 12 [2018-10-27 05:50:59,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:50:59,436 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2018-10-27 05:50:59,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:50:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2018-10-27 05:50:59,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-27 05:50:59,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:50:59,436 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:50:59,437 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:50:59,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:50:59,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1136324785, now seen corresponding path program 1 times [2018-10-27 05:50:59,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:50:59,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:59,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:50:59,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:59,439 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:50:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:50:59,487 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:50:59,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:50:59,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:50:59,488 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:50:59,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:50:59,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:50:59,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:50:59,489 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand 3 states. [2018-10-27 05:50:59,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:50:59,582 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2018-10-27 05:50:59,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:50:59,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-27 05:50:59,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:50:59,585 INFO L225 Difference]: With dead ends: 90 [2018-10-27 05:50:59,585 INFO L226 Difference]: Without dead ends: 88 [2018-10-27 05:50:59,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:50:59,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-27 05:50:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2018-10-27 05:50:59,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-27 05:50:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2018-10-27 05:50:59,595 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 13 [2018-10-27 05:50:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:50:59,596 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2018-10-27 05:50:59,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:50:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2018-10-27 05:50:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-27 05:50:59,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:50:59,596 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:50:59,597 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:50:59,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:50:59,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1137470874, now seen corresponding path program 1 times [2018-10-27 05:50:59,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:50:59,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:59,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:50:59,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:50:59,599 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:50:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:50:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 05:50:59,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:50:59,648 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:50:59,651 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-10-27 05:50:59,653 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [15], [16], [18], [60], [67], [68], [69] [2018-10-27 05:50:59,690 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:50:59,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:50:59,899 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:50:59,900 INFO L272 AbstractInterpreter]: Visited 11 different actions 67 times. Merged at 5 different actions 47 times. Widened at 1 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-10-27 05:50:59,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:50:59,934 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:50:59,984 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 51.88% of their original sizes. [2018-10-27 05:50:59,984 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:51:00,147 INFO L415 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-10-27 05:51:00,148 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:51:00,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:51:00,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2018-10-27 05:51:00,149 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:51:00,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 05:51:00,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 05:51:00,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:51:00,150 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand 6 states. [2018-10-27 05:51:00,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:51:00,595 INFO L93 Difference]: Finished difference Result 84 states and 122 transitions. [2018-10-27 05:51:00,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:51:00,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-27 05:51:00,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:51:00,596 INFO L225 Difference]: With dead ends: 84 [2018-10-27 05:51:00,596 INFO L226 Difference]: Without dead ends: 83 [2018-10-27 05:51:00,597 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:51:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-27 05:51:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-10-27 05:51:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-27 05:51:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2018-10-27 05:51:00,604 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 13 [2018-10-27 05:51:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:51:00,605 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. [2018-10-27 05:51:00,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 05:51:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2018-10-27 05:51:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 05:51:00,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:51:00,605 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:51:00,606 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:51:00,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:00,606 INFO L82 PathProgramCache]: Analyzing trace with hash 866521714, now seen corresponding path program 1 times [2018-10-27 05:51:00,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:51:00,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:00,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:51:00,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:00,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:51:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:51:00,639 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:51:00,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:51:00,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:51:00,639 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:51:00,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:51:00,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:51:00,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:51:00,640 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand 3 states. [2018-10-27 05:51:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:51:00,740 INFO L93 Difference]: Finished difference Result 151 states and 223 transitions. [2018-10-27 05:51:00,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:51:00,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-27 05:51:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:51:00,743 INFO L225 Difference]: With dead ends: 151 [2018-10-27 05:51:00,744 INFO L226 Difference]: Without dead ends: 149 [2018-10-27 05:51:00,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:51:00,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-27 05:51:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 141. [2018-10-27 05:51:00,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-27 05:51:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2018-10-27 05:51:00,758 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 14 [2018-10-27 05:51:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:51:00,758 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2018-10-27 05:51:00,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:51:00,759 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2018-10-27 05:51:00,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 05:51:00,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:51:00,760 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:51:00,760 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:51:00,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:00,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1092369434, now seen corresponding path program 1 times [2018-10-27 05:51:00,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:51:00,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:00,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:51:00,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:00,762 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:51:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:51:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:51:00,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:51:00,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:51:00,796 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:51:00,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:51:00,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:51:00,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:51:00,797 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand 3 states. [2018-10-27 05:51:00,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:51:00,924 INFO L93 Difference]: Finished difference Result 275 states and 409 transitions. [2018-10-27 05:51:00,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:51:00,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-27 05:51:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:51:00,926 INFO L225 Difference]: With dead ends: 275 [2018-10-27 05:51:00,926 INFO L226 Difference]: Without dead ends: 273 [2018-10-27 05:51:00,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:51:00,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-27 05:51:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 269. [2018-10-27 05:51:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-27 05:51:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 397 transitions. [2018-10-27 05:51:00,955 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 397 transitions. Word has length 15 [2018-10-27 05:51:00,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:51:00,956 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 397 transitions. [2018-10-27 05:51:00,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:51:00,956 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 397 transitions. [2018-10-27 05:51:00,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 05:51:00,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:51:00,957 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:51:00,957 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:51:00,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:00,958 INFO L82 PathProgramCache]: Analyzing trace with hash 195554908, now seen corresponding path program 1 times [2018-10-27 05:51:00,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:51:00,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:00,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:51:00,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:00,963 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:51:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:51:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:51:01,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:51:01,041 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:51:01,042 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-10-27 05:51:01,042 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [16], [18], [21], [24], [25], [26], [28], [67], [68], [69] [2018-10-27 05:51:01,043 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:51:01,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:51:01,173 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:51:01,173 INFO L272 AbstractInterpreter]: Visited 14 different actions 97 times. Merged at 8 different actions 74 times. Widened at 1 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-10-27 05:51:01,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:01,188 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:51:01,229 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 38% of their original sizes. [2018-10-27 05:51:01,231 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:51:01,569 INFO L415 sIntCurrentIteration]: We unified 19 AI predicates to 19 [2018-10-27 05:51:01,569 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:51:01,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:51:01,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [3] total 12 [2018-10-27 05:51:01,570 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:51:01,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 05:51:01,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 05:51:01,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:51:01,571 INFO L87 Difference]: Start difference. First operand 269 states and 397 transitions. Second operand 11 states. [2018-10-27 05:51:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:51:02,557 INFO L93 Difference]: Finished difference Result 438 states and 607 transitions. [2018-10-27 05:51:02,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 05:51:02,557 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-27 05:51:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:51:02,559 INFO L225 Difference]: With dead ends: 438 [2018-10-27 05:51:02,559 INFO L226 Difference]: Without dead ends: 436 [2018-10-27 05:51:02,560 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:51:02,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-10-27 05:51:02,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 337. [2018-10-27 05:51:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-27 05:51:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 496 transitions. [2018-10-27 05:51:02,580 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 496 transitions. Word has length 20 [2018-10-27 05:51:02,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:51:02,581 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 496 transitions. [2018-10-27 05:51:02,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 05:51:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 496 transitions. [2018-10-27 05:51:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-27 05:51:02,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:51:02,582 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:51:02,582 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:51:02,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:02,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1628808007, now seen corresponding path program 1 times [2018-10-27 05:51:02,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:51:02,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:02,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:51:02,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:02,584 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:51:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:51:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:51:02,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:51:02,655 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:51:02,655 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-10-27 05:51:02,656 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [16], [18], [21], [24], [26], [27], [30], [33], [35], [37], [67], [68], [69] [2018-10-27 05:51:02,657 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:51:02,657 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:51:02,719 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:51:02,719 INFO L272 AbstractInterpreter]: Visited 17 different actions 127 times. Merged at 11 different actions 101 times. Widened at 1 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-10-27 05:51:02,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:02,722 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:51:02,743 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 39.41% of their original sizes. [2018-10-27 05:51:02,743 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:51:03,181 INFO L415 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2018-10-27 05:51:03,181 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:51:03,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:51:03,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [3] total 13 [2018-10-27 05:51:03,182 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:51:03,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 05:51:03,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 05:51:03,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-27 05:51:03,182 INFO L87 Difference]: Start difference. First operand 337 states and 496 transitions. Second operand 12 states. [2018-10-27 05:51:04,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:51:04,304 INFO L93 Difference]: Finished difference Result 509 states and 707 transitions. [2018-10-27 05:51:04,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:51:04,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-10-27 05:51:04,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:51:04,308 INFO L225 Difference]: With dead ends: 509 [2018-10-27 05:51:04,308 INFO L226 Difference]: Without dead ends: 507 [2018-10-27 05:51:04,309 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-27 05:51:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-10-27 05:51:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 405. [2018-10-27 05:51:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-27 05:51:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 595 transitions. [2018-10-27 05:51:04,341 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 595 transitions. Word has length 22 [2018-10-27 05:51:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:51:04,341 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 595 transitions. [2018-10-27 05:51:04,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 05:51:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 595 transitions. [2018-10-27 05:51:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 05:51:04,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:51:04,342 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:51:04,345 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:51:04,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:04,346 INFO L82 PathProgramCache]: Analyzing trace with hash -143968740, now seen corresponding path program 1 times [2018-10-27 05:51:04,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:51:04,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:04,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:51:04,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:04,347 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:51:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:51:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:51:04,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:51:04,514 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:51:04,515 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-27 05:51:04,515 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [16], [18], [21], [30], [39], [42], [43], [44], [46], [67], [68], [69] [2018-10-27 05:51:04,516 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:51:04,516 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:51:04,590 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:51:04,591 INFO L272 AbstractInterpreter]: Visited 16 different actions 117 times. Merged at 10 different actions 92 times. Widened at 1 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-10-27 05:51:04,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:04,610 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:51:04,637 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 38.42% of their original sizes. [2018-10-27 05:51:04,637 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:51:04,805 INFO L415 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-10-27 05:51:04,805 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:51:04,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:51:04,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [3] total 16 [2018-10-27 05:51:04,806 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:51:04,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 05:51:04,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 05:51:04,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-10-27 05:51:04,807 INFO L87 Difference]: Start difference. First operand 405 states and 595 transitions. Second operand 15 states. [2018-10-27 05:51:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:51:06,431 INFO L93 Difference]: Finished difference Result 609 states and 837 transitions. [2018-10-27 05:51:06,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 05:51:06,431 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-10-27 05:51:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:51:06,433 INFO L225 Difference]: With dead ends: 609 [2018-10-27 05:51:06,433 INFO L226 Difference]: Without dead ends: 607 [2018-10-27 05:51:06,434 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-10-27 05:51:06,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-10-27 05:51:06,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 470. [2018-10-27 05:51:06,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-10-27 05:51:06,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 692 transitions. [2018-10-27 05:51:06,458 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 692 transitions. Word has length 24 [2018-10-27 05:51:06,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:51:06,458 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 692 transitions. [2018-10-27 05:51:06,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 05:51:06,458 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 692 transitions. [2018-10-27 05:51:06,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 05:51:06,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:51:06,459 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:51:06,460 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:51:06,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:06,460 INFO L82 PathProgramCache]: Analyzing trace with hash -123954094, now seen corresponding path program 1 times [2018-10-27 05:51:06,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:51:06,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:06,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:51:06,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:06,461 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:51:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:51:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 05:51:06,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:51:06,530 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:51:06,530 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-10-27 05:51:06,530 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [16], [18], [21], [24], [25], [26], [28], [60], [67], [68], [69] [2018-10-27 05:51:06,531 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:51:06,531 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:51:06,627 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:51:06,627 INFO L272 AbstractInterpreter]: Visited 15 different actions 249 times. Merged at 9 different actions 188 times. Widened at 2 different actions 20 times. Found 25 fixpoints after 3 different actions. Largest state had 6 variables. [2018-10-27 05:51:06,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:06,671 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:51:06,690 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 34.5% of their original sizes. [2018-10-27 05:51:06,690 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:51:06,809 INFO L415 sIntCurrentIteration]: We unified 24 AI predicates to 24 [2018-10-27 05:51:06,809 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:51:06,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:51:06,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [3] total 12 [2018-10-27 05:51:06,809 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:51:06,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 05:51:06,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 05:51:06,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:51:06,810 INFO L87 Difference]: Start difference. First operand 470 states and 692 transitions. Second operand 11 states. [2018-10-27 05:51:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:51:08,147 INFO L93 Difference]: Finished difference Result 562 states and 778 transitions. [2018-10-27 05:51:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 05:51:08,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-10-27 05:51:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:51:08,150 INFO L225 Difference]: With dead ends: 562 [2018-10-27 05:51:08,150 INFO L226 Difference]: Without dead ends: 560 [2018-10-27 05:51:08,150 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-10-27 05:51:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-10-27 05:51:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 403. [2018-10-27 05:51:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-27 05:51:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 586 transitions. [2018-10-27 05:51:08,182 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 586 transitions. Word has length 25 [2018-10-27 05:51:08,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:51:08,183 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 586 transitions. [2018-10-27 05:51:08,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 05:51:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 586 transitions. [2018-10-27 05:51:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 05:51:08,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:51:08,185 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:51:08,185 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:51:08,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:08,185 INFO L82 PathProgramCache]: Analyzing trace with hash -981204821, now seen corresponding path program 1 times [2018-10-27 05:51:08,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:51:08,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:08,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:51:08,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:08,189 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:51:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:51:08,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:51:08,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:51:08,244 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:51:08,244 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-10-27 05:51:08,244 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [16], [18], [21], [30], [39], [42], [44], [45], [48], [51], [53], [55], [67], [68], [69] [2018-10-27 05:51:08,245 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:51:08,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:51:08,302 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:51:08,303 INFO L272 AbstractInterpreter]: Visited 19 different actions 147 times. Merged at 13 different actions 119 times. Widened at 1 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-10-27 05:51:08,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:08,355 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:51:08,380 INFO L227 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 39.52% of their original sizes. [2018-10-27 05:51:08,381 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:51:08,885 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-10-27 05:51:08,886 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:51:08,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:51:08,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [3] total 17 [2018-10-27 05:51:08,886 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:51:08,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 05:51:08,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 05:51:08,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-27 05:51:08,887 INFO L87 Difference]: Start difference. First operand 403 states and 586 transitions. Second operand 16 states. [2018-10-27 05:51:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:51:10,244 INFO L93 Difference]: Finished difference Result 859 states and 1199 transitions. [2018-10-27 05:51:10,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 05:51:10,244 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-10-27 05:51:10,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:51:10,246 INFO L225 Difference]: With dead ends: 859 [2018-10-27 05:51:10,246 INFO L226 Difference]: Without dead ends: 599 [2018-10-27 05:51:10,249 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-27 05:51:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-10-27 05:51:10,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 471. [2018-10-27 05:51:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-10-27 05:51:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 683 transitions. [2018-10-27 05:51:10,276 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 683 transitions. Word has length 26 [2018-10-27 05:51:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:51:10,277 INFO L481 AbstractCegarLoop]: Abstraction has 471 states and 683 transitions. [2018-10-27 05:51:10,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 05:51:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 683 transitions. [2018-10-27 05:51:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-27 05:51:10,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:51:10,278 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:51:10,278 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:51:10,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:10,278 INFO L82 PathProgramCache]: Analyzing trace with hash 560686383, now seen corresponding path program 1 times [2018-10-27 05:51:10,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:51:10,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:10,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:51:10,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:10,282 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:51:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:51:10,340 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 05:51:10,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:51:10,340 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:51:10,341 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-27 05:51:10,341 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [16], [18], [21], [24], [26], [27], [30], [33], [35], [37], [60], [67], [68], [69] [2018-10-27 05:51:10,342 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:51:10,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:51:10,438 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:51:10,439 INFO L272 AbstractInterpreter]: Visited 18 different actions 308 times. Merged at 12 different actions 246 times. Widened at 2 different actions 19 times. Found 24 fixpoints after 3 different actions. Largest state had 6 variables. [2018-10-27 05:51:10,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:10,483 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:51:10,521 INFO L227 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 35.91% of their original sizes. [2018-10-27 05:51:10,521 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:51:11,401 INFO L415 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-10-27 05:51:11,401 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:51:11,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:51:11,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [3] total 13 [2018-10-27 05:51:11,401 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:51:11,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 05:51:11,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 05:51:11,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-27 05:51:11,402 INFO L87 Difference]: Start difference. First operand 471 states and 683 transitions. Second operand 12 states. [2018-10-27 05:51:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:51:12,587 INFO L93 Difference]: Finished difference Result 583 states and 795 transitions. [2018-10-27 05:51:12,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:51:12,588 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-10-27 05:51:12,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:51:12,590 INFO L225 Difference]: With dead ends: 583 [2018-10-27 05:51:12,591 INFO L226 Difference]: Without dead ends: 581 [2018-10-27 05:51:12,591 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-10-27 05:51:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-10-27 05:51:12,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 398. [2018-10-27 05:51:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-10-27 05:51:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 574 transitions. [2018-10-27 05:51:12,624 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 574 transitions. Word has length 27 [2018-10-27 05:51:12,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:51:12,624 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 574 transitions. [2018-10-27 05:51:12,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 05:51:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 574 transitions. [2018-10-27 05:51:12,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 05:51:12,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:51:12,629 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:51:12,630 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:51:12,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:12,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1515620174, now seen corresponding path program 1 times [2018-10-27 05:51:12,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:51:12,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:12,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:51:12,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:12,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:51:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:51:12,804 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 05:51:12,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:51:12,804 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:51:12,804 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-10-27 05:51:12,804 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [16], [18], [21], [24], [25], [26], [28], [30], [33], [35], [37], [67], [68], [69] [2018-10-27 05:51:12,805 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:51:12,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:51:12,905 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:51:12,905 INFO L272 AbstractInterpreter]: Visited 18 different actions 321 times. Merged at 12 different actions 257 times. Widened at 2 different actions 21 times. Found 25 fixpoints after 3 different actions. Largest state had 6 variables. [2018-10-27 05:51:12,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:12,941 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:51:12,962 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 33.75% of their original sizes. [2018-10-27 05:51:12,963 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:51:13,903 INFO L415 sIntCurrentIteration]: We unified 28 AI predicates to 28 [2018-10-27 05:51:13,903 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:51:13,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:51:13,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [3] total 13 [2018-10-27 05:51:13,903 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:51:13,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 05:51:13,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 05:51:13,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-27 05:51:13,904 INFO L87 Difference]: Start difference. First operand 398 states and 574 transitions. Second operand 12 states. [2018-10-27 05:51:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:51:15,084 INFO L93 Difference]: Finished difference Result 566 states and 742 transitions. [2018-10-27 05:51:15,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:51:15,084 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-10-27 05:51:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:51:15,086 INFO L225 Difference]: With dead ends: 566 [2018-10-27 05:51:15,087 INFO L226 Difference]: Without dead ends: 562 [2018-10-27 05:51:15,087 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-10-27 05:51:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-10-27 05:51:15,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 133. [2018-10-27 05:51:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-27 05:51:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 178 transitions. [2018-10-27 05:51:15,115 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 178 transitions. Word has length 29 [2018-10-27 05:51:15,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:51:15,116 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 178 transitions. [2018-10-27 05:51:15,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 05:51:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions. [2018-10-27 05:51:15,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 05:51:15,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:51:15,116 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:51:15,117 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:51:15,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:15,117 INFO L82 PathProgramCache]: Analyzing trace with hash -573834990, now seen corresponding path program 1 times [2018-10-27 05:51:15,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:51:15,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:15,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:51:15,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:15,122 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:51:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:51:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 05:51:15,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:51:15,276 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:51:15,276 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-10-27 05:51:15,276 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [16], [18], [21], [30], [39], [42], [43], [44], [46], [60], [67], [68], [69] [2018-10-27 05:51:15,277 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:51:15,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:51:15,409 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:51:15,409 INFO L272 AbstractInterpreter]: Visited 17 different actions 323 times. Merged at 11 different actions 256 times. Widened at 2 different actions 22 times. Found 27 fixpoints after 3 different actions. Largest state had 6 variables. [2018-10-27 05:51:15,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:15,455 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:51:15,475 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 35.42% of their original sizes. [2018-10-27 05:51:15,475 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:51:16,056 INFO L415 sIntCurrentIteration]: We unified 28 AI predicates to 28 [2018-10-27 05:51:16,056 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:51:16,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:51:16,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [3] total 16 [2018-10-27 05:51:16,056 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:51:16,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 05:51:16,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 05:51:16,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2018-10-27 05:51:16,057 INFO L87 Difference]: Start difference. First operand 133 states and 178 transitions. Second operand 15 states. [2018-10-27 05:51:17,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:51:17,033 INFO L93 Difference]: Finished difference Result 180 states and 223 transitions. [2018-10-27 05:51:17,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 05:51:17,033 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-10-27 05:51:17,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:51:17,034 INFO L225 Difference]: With dead ends: 180 [2018-10-27 05:51:17,034 INFO L226 Difference]: Without dead ends: 178 [2018-10-27 05:51:17,034 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2018-10-27 05:51:17,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-27 05:51:17,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 108. [2018-10-27 05:51:17,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-27 05:51:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 142 transitions. [2018-10-27 05:51:17,052 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 142 transitions. Word has length 29 [2018-10-27 05:51:17,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:51:17,052 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 142 transitions. [2018-10-27 05:51:17,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 05:51:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 142 transitions. [2018-10-27 05:51:17,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 05:51:17,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:51:17,053 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:51:17,053 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:51:17,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:17,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1765810655, now seen corresponding path program 1 times [2018-10-27 05:51:17,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:51:17,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:17,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:51:17,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:17,058 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:51:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:51:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 05:51:17,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:51:17,105 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:51:17,105 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-10-27 05:51:17,105 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [16], [18], [21], [30], [39], [42], [44], [45], [48], [51], [53], [55], [60], [67], [68], [69] [2018-10-27 05:51:17,106 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:51:17,106 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:51:17,185 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:51:17,185 INFO L272 AbstractInterpreter]: Visited 20 different actions 309 times. Merged at 14 different actions 251 times. Widened at 2 different actions 16 times. Found 21 fixpoints after 3 different actions. Largest state had 6 variables. [2018-10-27 05:51:17,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:17,211 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:51:17,230 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 36.54% of their original sizes. [2018-10-27 05:51:17,230 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:51:17,446 INFO L415 sIntCurrentIteration]: We unified 30 AI predicates to 30 [2018-10-27 05:51:17,446 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:51:17,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:51:17,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [3] total 17 [2018-10-27 05:51:17,447 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:51:17,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 05:51:17,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 05:51:17,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-10-27 05:51:17,448 INFO L87 Difference]: Start difference. First operand 108 states and 142 transitions. Second operand 16 states. [2018-10-27 05:51:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:51:18,276 INFO L93 Difference]: Finished difference Result 223 states and 284 transitions. [2018-10-27 05:51:18,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 05:51:18,276 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-10-27 05:51:18,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:51:18,277 INFO L225 Difference]: With dead ends: 223 [2018-10-27 05:51:18,277 INFO L226 Difference]: Without dead ends: 139 [2018-10-27 05:51:18,278 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2018-10-27 05:51:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-27 05:51:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 72. [2018-10-27 05:51:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-27 05:51:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2018-10-27 05:51:18,301 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 31 [2018-10-27 05:51:18,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:51:18,301 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2018-10-27 05:51:18,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 05:51:18,301 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2018-10-27 05:51:18,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 05:51:18,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:51:18,302 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:51:18,302 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:51:18,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:18,302 INFO L82 PathProgramCache]: Analyzing trace with hash 253297835, now seen corresponding path program 1 times [2018-10-27 05:51:18,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:51:18,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:18,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:51:18,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:51:18,304 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:51:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:51:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 05:51:18,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:51:18,450 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:51:18,451 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-10-27 05:51:18,451 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [16], [18], [21], [30], [39], [42], [43], [44], [46], [48], [51], [53], [55], [67], [68], [69] [2018-10-27 05:51:18,452 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:51:18,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:51:18,572 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:51:18,572 INFO L272 AbstractInterpreter]: Visited 20 different actions 339 times. Merged at 14 different actions 277 times. Widened at 2 different actions 18 times. Found 23 fixpoints after 3 different actions. Largest state had 6 variables. [2018-10-27 05:51:18,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:51:18,611 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:51:18,636 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 33.67% of their original sizes. [2018-10-27 05:51:18,636 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:51:19,213 INFO L415 sIntCurrentIteration]: We unified 34 AI predicates to 34 [2018-10-27 05:51:19,213 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:51:19,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:51:19,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [3] total 17 [2018-10-27 05:51:19,213 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:51:19,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 05:51:19,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 05:51:19,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-10-27 05:51:19,214 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand 16 states. [2018-10-27 05:51:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:51:19,784 INFO L93 Difference]: Finished difference Result 154 states and 186 transitions. [2018-10-27 05:51:19,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 05:51:19,784 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-10-27 05:51:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:51:19,785 INFO L225 Difference]: With dead ends: 154 [2018-10-27 05:51:19,785 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 05:51:19,786 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2018-10-27 05:51:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 05:51:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 05:51:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 05:51:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 05:51:19,790 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-10-27 05:51:19,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:51:19,790 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 05:51:19,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 05:51:19,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 05:51:19,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 05:51:19,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 05:51:21,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:51:21,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:51:22,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:51:22,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:51:22,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:51:22,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:51:24,994 WARN L179 SmtUtils]: Spent 5.18 s on a formula simplification. DAG size of input: 637 DAG size of output: 603 [2018-10-27 05:51:28,749 WARN L179 SmtUtils]: Spent 3.72 s on a formula simplification. DAG size of input: 603 DAG size of output: 37 [2018-10-27 05:51:28,751 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 05:51:28,751 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:51:28,751 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:51:28,751 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 05:51:28,751 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 05:51:28,751 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 05:51:28,751 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 31) no Hoare annotation was computed. [2018-10-27 05:51:28,751 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 13 35) no Hoare annotation was computed. [2018-10-27 05:51:28,752 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 31) no Hoare annotation was computed. [2018-10-27 05:51:28,752 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 33) no Hoare annotation was computed. [2018-10-27 05:51:28,752 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 33) no Hoare annotation was computed. [2018-10-27 05:51:28,752 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-10-27 05:51:28,752 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:51:28,752 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-10-27 05:51:28,752 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-27 05:51:28,752 INFO L425 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2018-10-27 05:51:28,752 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-10-27 05:51:28,752 INFO L425 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-10-27 05:51:28,752 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-10-27 05:51:28,752 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-10-27 05:51:28,752 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:51:28,752 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2018-10-27 05:51:28,753 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-10-27 05:51:28,753 INFO L425 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-10-27 05:51:28,753 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2018-10-27 05:51:28,753 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 13 35) no Hoare annotation was computed. [2018-10-27 05:51:28,753 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2018-10-27 05:51:28,753 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2018-10-27 05:51:28,753 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-10-27 05:51:28,753 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 13 35) the Hoare annotation is: true [2018-10-27 05:51:28,753 INFO L425 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2018-10-27 05:51:28,753 INFO L425 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-10-27 05:51:28,753 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-10-27 05:51:28,753 INFO L425 ceAbstractionStarter]: For program point L22(lines 22 32) no Hoare annotation was computed. [2018-10-27 05:51:28,754 INFO L421 ceAbstractionStarter]: At program point L22-1(lines 19 33) the Hoare annotation is: (or (let ((.cse0 (+ main_~y~0 10))) (and (<= main_~i~0 main_~x~0) (<= .cse0 main_~N~0) (<= 10 (+ main_~i~0 main_~N~0)) (<= (* 2 main_~N~0) 20) (<= (+ main_~x~0 10) main_~N~0) (<= main_~N~0 .cse0))) (and (and (<= 0 (+ main_~x~0 main_~i~0)) (<= main_~x~0 main_~i~0) (<= main_~i~0 main_~N~0) (= main_~N~0 10) (<= (* 2 main_~r~0) 4294967294) (<= 0 (+ main_~N~0 main_~r~0 2147483638))) (<= main_~y~0 main_~i~0) (<= 0 (+ main_~i~0 main_~y~0)))) [2018-10-27 05:51:28,754 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-10-27 05:51:28,754 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2018-10-27 05:51:28,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:51:28 BoogieIcfgContainer [2018-10-27 05:51:28,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 05:51:28,764 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 05:51:28,764 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 05:51:28,764 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 05:51:28,765 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:50:58" (3/4) ... [2018-10-27 05:51:28,769 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 05:51:28,774 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 05:51:28,775 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 05:51:28,778 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-27 05:51:28,779 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-27 05:51:28,779 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 05:51:28,779 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 05:51:28,812 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_10333b72-1af1-4b5f-a576-62d7763730ef/bin-2019/utaipan/witness.graphml [2018-10-27 05:51:28,812 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 05:51:28,813 INFO L168 Benchmark]: Toolchain (without parser) took 30756.82 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 433.6 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -256.6 MB). Peak memory consumption was 177.0 MB. Max. memory is 11.5 GB. [2018-10-27 05:51:28,814 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:51:28,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.80 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 05:51:28,814 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.28 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:51:28,816 INFO L168 Benchmark]: Boogie Preprocessor took 19.05 ms. Allocated memory is still 1.0 GB. Free memory was 946.4 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 05:51:28,816 INFO L168 Benchmark]: RCFGBuilder took 514.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 941.0 MB in the beginning and 1.2 GB in the end (delta: -211.5 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-10-27 05:51:28,817 INFO L168 Benchmark]: TraceAbstraction took 29987.33 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 265.8 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -61.4 MB). Peak memory consumption was 481.6 MB. Max. memory is 11.5 GB. [2018-10-27 05:51:28,817 INFO L168 Benchmark]: Witness Printer took 48.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 175.0 kB). Peak memory consumption was 175.0 kB. Max. memory is 11.5 GB. [2018-10-27 05:51:28,819 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.80 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.28 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.05 ms. Allocated memory is still 1.0 GB. Free memory was 946.4 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 514.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 941.0 MB in the beginning and 1.2 GB in the end (delta: -211.5 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29987.33 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 265.8 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -61.4 MB). Peak memory consumption was 481.6 MB. Max. memory is 11.5 GB. * Witness Printer took 48.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 175.0 kB). Peak memory consumption was 175.0 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((i <= x && y + 10 <= N) && 10 <= i + N) && 2 * N <= 20) && x + 10 <= N) && N <= y + 10) || (((((((0 <= x + i && x <= i) && i <= N) && N == 10) && 2 * r <= 4294967294) && 0 <= N + r + 2147483638) && y <= i) && 0 <= i + y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 37 locations, 10 error locations. SAFE Result, 29.9s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 12.2s AutomataDifference, 0.0s DeadEndRemovalTime, 8.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 402 SDtfs, 1301 SDslu, 1030 SDs, 0 SdLazy, 898 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 22 DeclaredPredicates, 299 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 11 AbstIntIterations, 11 AbstIntStrong, 0.9833333333333335 AbsIntWeakeningRatio, 0.3037037037037037 AbsIntAvgWeakeningVarsNumRemoved, 21.211111111111112 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 1400 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 21 NumberOfFragments, 69 HoareAnnotationTreeSize, 5 FomulaSimplifications, 8573687 FormulaSimplificationTreeSizeReduction, 5.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 23986065 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 23009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 51/147 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...