./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:55:26,828 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:55:26,829 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:55:26,835 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:55:26,835 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:55:26,836 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:55:26,837 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:55:26,837 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:55:26,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:55:26,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:55:26,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:55:26,839 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:55:26,840 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:55:26,840 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:55:26,841 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:55:26,841 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:55:26,841 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:55:26,842 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:55:26,843 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:55:26,844 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:55:26,844 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:55:26,845 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:55:26,846 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:55:26,846 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:55:26,846 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:55:26,847 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:55:26,847 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:55:26,848 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:55:26,848 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:55:26,849 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:55:26,849 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:55:26,849 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:55:26,849 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:55:26,849 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:55:26,850 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:55:26,850 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:55:26,850 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-12-09 00:55:26,857 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:55:26,857 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:55:26,858 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:55:26,858 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:55:26,858 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:55:26,858 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:55:26,858 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:55:26,858 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:55:26,859 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 00:55:26,859 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:55:26,859 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:55:26,859 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:55:26,859 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:55:26,859 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:55:26,859 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-09 00:55:26,859 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:55:26,859 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:55:26,859 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:55:26,859 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:55:26,859 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:55:26,860 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:55:26,860 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:55:26,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:55:26,860 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:55:26,860 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:55:26,860 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:55:26,860 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:55:26,860 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:55:26,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:55:26,860 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2018-12-09 00:55:26,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:55:26,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:55:26,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:55:26,891 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:55:26,891 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:55:26,892 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-12-09 00:55:26,935 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/data/672185cb6/894e02c3cf15403abf1d5f9e85397ca8/FLAG0b7472806 [2018-12-09 00:55:27,313 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:55:27,313 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-12-09 00:55:27,316 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/data/672185cb6/894e02c3cf15403abf1d5f9e85397ca8/FLAG0b7472806 [2018-12-09 00:55:27,324 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/data/672185cb6/894e02c3cf15403abf1d5f9e85397ca8 [2018-12-09 00:55:27,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:55:27,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:55:27,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:55:27,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:55:27,330 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:55:27,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:55:27" (1/1) ... [2018-12-09 00:55:27,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd2551a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:55:27, skipping insertion in model container [2018-12-09 00:55:27,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:55:27" (1/1) ... [2018-12-09 00:55:27,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:55:27,344 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:55:27,425 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:55:27,427 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:55:27,437 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:55:27,444 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:55:27,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:55:27 WrapperNode [2018-12-09 00:55:27,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:55:27,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:55:27,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:55:27,445 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:55:27,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:55:27" (1/1) ... [2018-12-09 00:55:27,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:55:27" (1/1) ... [2018-12-09 00:55:27,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:55:27,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:55:27,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:55:27,457 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:55:27,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:55:27" (1/1) ... [2018-12-09 00:55:27,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:55:27" (1/1) ... [2018-12-09 00:55:27,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:55:27" (1/1) ... [2018-12-09 00:55:27,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:55:27" (1/1) ... [2018-12-09 00:55:27,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:55:27" (1/1) ... [2018-12-09 00:55:27,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:55:27" (1/1) ... [2018-12-09 00:55:27,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:55:27" (1/1) ... [2018-12-09 00:55:27,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:55:27,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:55:27,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:55:27,470 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:55:27,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:55:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:55:27,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:55:27,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:55:27,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:55:27,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:55:27,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:55:27,533 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:55:27,642 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:55:27,642 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-09 00:55:27,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:55:27 BoogieIcfgContainer [2018-12-09 00:55:27,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:55:27,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:55:27,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:55:27,646 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:55:27,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:55:27" (1/3) ... [2018-12-09 00:55:27,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175bec0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:55:27, skipping insertion in model container [2018-12-09 00:55:27,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:55:27" (2/3) ... [2018-12-09 00:55:27,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175bec0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:55:27, skipping insertion in model container [2018-12-09 00:55:27,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:55:27" (3/3) ... [2018-12-09 00:55:27,649 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-12-09 00:55:27,655 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:55:27,659 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-12-09 00:55:27,669 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-12-09 00:55:27,687 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:55:27,688 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:55:27,688 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:55:27,688 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:55:27,688 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:55:27,688 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:55:27,688 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:55:27,688 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:55:27,688 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:55:27,704 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-12-09 00:55:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 00:55:27,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:27,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:27,711 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:27,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:27,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2054482639, now seen corresponding path program 1 times [2018-12-09 00:55:27,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:27,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:27,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:27,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:27,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:27,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:55:27,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:55:27,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 00:55:27,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 00:55:27,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 00:55:27,803 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-12-09 00:55:27,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:27,820 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-12-09 00:55:27,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 00:55:27,821 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-12-09 00:55:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:27,827 INFO L225 Difference]: With dead ends: 56 [2018-12-09 00:55:27,827 INFO L226 Difference]: Without dead ends: 26 [2018-12-09 00:55:27,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 00:55:27,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-09 00:55:27,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-09 00:55:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-09 00:55:27,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-09 00:55:27,849 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 9 [2018-12-09 00:55:27,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:27,849 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-09 00:55:27,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 00:55:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-09 00:55:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 00:55:27,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:27,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:27,850 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:27,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:27,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2054481740, now seen corresponding path program 1 times [2018-12-09 00:55:27,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:27,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:27,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:27,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:27,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:27,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:55:27,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:55:27,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:55:27,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:55:27,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:55:27,888 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 3 states. [2018-12-09 00:55:27,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:27,913 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-12-09 00:55:27,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:55:27,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-09 00:55:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:27,914 INFO L225 Difference]: With dead ends: 45 [2018-12-09 00:55:27,914 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 00:55:27,915 INFO L631 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-12-09 00:55:27,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 00:55:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 29. [2018-12-09 00:55:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 00:55:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-09 00:55:27,918 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 9 [2018-12-09 00:55:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:27,918 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-09 00:55:27,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:55:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-09 00:55:27,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 00:55:27,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:27,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:27,919 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:27,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:27,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2054481774, now seen corresponding path program 1 times [2018-12-09 00:55:27,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:27,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:27,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:27,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:27,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:27,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:55:27,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:55:27,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:55:27,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:55:27,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:55:27,935 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2018-12-09 00:55:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:27,949 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-12-09 00:55:27,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:55:27,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-09 00:55:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:27,950 INFO L225 Difference]: With dead ends: 38 [2018-12-09 00:55:27,950 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 00:55:27,951 INFO L631 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-12-09 00:55:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 00:55:27,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-12-09 00:55:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 00:55:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-12-09 00:55:27,954 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 9 [2018-12-09 00:55:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:27,954 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-09 00:55:27,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:55:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-12-09 00:55:27,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 00:55:27,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:27,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:27,955 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:27,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:27,955 INFO L82 PathProgramCache]: Analyzing trace with hash -735575413, now seen corresponding path program 1 times [2018-12-09 00:55:27,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:27,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:27,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:27,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:27,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:27,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:55:27,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:55:27,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:55:27,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:55:27,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:55:27,971 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-12-09 00:55:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:27,989 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-12-09 00:55:27,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:55:27,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 00:55:27,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:27,989 INFO L225 Difference]: With dead ends: 49 [2018-12-09 00:55:27,990 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 00:55:27,990 INFO L631 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-12-09 00:55:27,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 00:55:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2018-12-09 00:55:27,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 00:55:27,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-12-09 00:55:27,993 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 10 [2018-12-09 00:55:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:27,993 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-12-09 00:55:27,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:55:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-12-09 00:55:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 00:55:27,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:27,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:27,994 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:27,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:27,994 INFO L82 PathProgramCache]: Analyzing trace with hash -735574387, now seen corresponding path program 1 times [2018-12-09 00:55:27,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:27,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:27,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:27,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:27,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:28,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:55:28,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:55:28,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:55:28,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:55:28,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:55:28,006 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2018-12-09 00:55:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:28,018 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-12-09 00:55:28,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:55:28,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 00:55:28,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:28,019 INFO L225 Difference]: With dead ends: 35 [2018-12-09 00:55:28,019 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 00:55:28,019 INFO L631 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-12-09 00:55:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 00:55:28,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-09 00:55:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 00:55:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-12-09 00:55:28,022 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 10 [2018-12-09 00:55:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:28,022 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-12-09 00:55:28,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:55:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-12-09 00:55:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 00:55:28,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:28,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:28,023 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:28,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:28,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1327969452, now seen corresponding path program 1 times [2018-12-09 00:55:28,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:28,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:28,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:28,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:28,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:55:28,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:55:28,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:55:28,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:55:28,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:55:28,039 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 3 states. [2018-12-09 00:55:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:28,047 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-12-09 00:55:28,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:55:28,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 00:55:28,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:28,048 INFO L225 Difference]: With dead ends: 34 [2018-12-09 00:55:28,048 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 00:55:28,048 INFO L631 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-12-09 00:55:28,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 00:55:28,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 00:55:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 00:55:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-12-09 00:55:28,051 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 11 [2018-12-09 00:55:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:28,051 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-09 00:55:28,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:55:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-12-09 00:55:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 00:55:28,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:28,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:28,052 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:28,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:28,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1782620015, now seen corresponding path program 1 times [2018-12-09 00:55:28,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:28,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:28,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:55:28,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:55:28,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:55:28,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:55:28,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:55:28,064 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2018-12-09 00:55:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:28,071 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-12-09 00:55:28,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:55:28,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 00:55:28,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:28,072 INFO L225 Difference]: With dead ends: 33 [2018-12-09 00:55:28,072 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 00:55:28,072 INFO L631 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-12-09 00:55:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 00:55:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-09 00:55:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 00:55:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-12-09 00:55:28,075 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 12 [2018-12-09 00:55:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:28,075 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-12-09 00:55:28,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:55:28,075 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-12-09 00:55:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 00:55:28,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:28,075 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:28,076 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:28,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:28,076 INFO L82 PathProgramCache]: Analyzing trace with hash -603938557, now seen corresponding path program 1 times [2018-12-09 00:55:28,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:28,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:28,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:28,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:28,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:55:28,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:55:28,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:55:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:28,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:55:28,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-12-09 00:55:28,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:55:28,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:55:28,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:55:28,136 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 4 states. [2018-12-09 00:55:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:28,159 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-12-09 00:55:28,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:55:28,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-09 00:55:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:28,159 INFO L225 Difference]: With dead ends: 58 [2018-12-09 00:55:28,159 INFO L226 Difference]: Without dead ends: 57 [2018-12-09 00:55:28,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:55:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-09 00:55:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2018-12-09 00:55:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 00:55:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-12-09 00:55:28,163 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 13 [2018-12-09 00:55:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:28,163 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-12-09 00:55:28,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:55:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-12-09 00:55:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 00:55:28,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:28,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:28,164 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:28,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:28,164 INFO L82 PathProgramCache]: Analyzing trace with hash -594114383, now seen corresponding path program 1 times [2018-12-09 00:55:28,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:28,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:28,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:28,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:28,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:55:28,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:55:28,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:55:28,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:55:28,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:55:28,178 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-12-09 00:55:28,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:28,197 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-12-09 00:55:28,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:55:28,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-09 00:55:28,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:28,199 INFO L225 Difference]: With dead ends: 36 [2018-12-09 00:55:28,199 INFO L226 Difference]: Without dead ends: 35 [2018-12-09 00:55:28,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:55:28,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-09 00:55:28,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-09 00:55:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 00:55:28,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-12-09 00:55:28,202 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 14 [2018-12-09 00:55:28,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:28,203 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-09 00:55:28,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:55:28,203 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-12-09 00:55:28,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 00:55:28,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:28,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:28,203 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:28,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:28,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1237676613, now seen corresponding path program 1 times [2018-12-09 00:55:28,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:28,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:28,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:28,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:28,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:55:28,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:55:28,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:55:28,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:55:28,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:55:28,219 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 4 states. [2018-12-09 00:55:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:28,244 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-12-09 00:55:28,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:55:28,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-09 00:55:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:28,245 INFO L225 Difference]: With dead ends: 38 [2018-12-09 00:55:28,245 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 00:55:28,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:55:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 00:55:28,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2018-12-09 00:55:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 00:55:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-12-09 00:55:28,249 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 15 [2018-12-09 00:55:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:28,249 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-12-09 00:55:28,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:55:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-12-09 00:55:28,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 00:55:28,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:28,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:28,250 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:28,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:28,250 INFO L82 PathProgramCache]: Analyzing trace with hash 286676217, now seen corresponding path program 1 times [2018-12-09 00:55:28,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:28,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:28,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:28,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:55:28,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:55:28,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:55:28,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:55:28,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:55:28,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:55:28,268 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 4 states. [2018-12-09 00:55:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:28,311 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-12-09 00:55:28,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:55:28,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-09 00:55:28,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:28,312 INFO L225 Difference]: With dead ends: 57 [2018-12-09 00:55:28,312 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 00:55:28,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:55:28,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 00:55:28,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 37. [2018-12-09 00:55:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 00:55:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-12-09 00:55:28,317 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 16 [2018-12-09 00:55:28,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:28,317 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-12-09 00:55:28,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:55:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-12-09 00:55:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 00:55:28,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:28,318 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:28,318 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:28,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:28,318 INFO L82 PathProgramCache]: Analyzing trace with hash 286676251, now seen corresponding path program 1 times [2018-12-09 00:55:28,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:28,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:28,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:28,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:28,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:55:28,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:55:28,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:55:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:28,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:55:28,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-12-09 00:55:28,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:55:28,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:55:28,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:55:28,378 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2018-12-09 00:55:28,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:28,395 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2018-12-09 00:55:28,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:55:28,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-09 00:55:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:28,396 INFO L225 Difference]: With dead ends: 66 [2018-12-09 00:55:28,396 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 00:55:28,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:55:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 00:55:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-12-09 00:55:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-09 00:55:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-12-09 00:55:28,403 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 16 [2018-12-09 00:55:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:28,403 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-12-09 00:55:28,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:55:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-12-09 00:55:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 00:55:28,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:28,404 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:28,404 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:28,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:28,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1189435590, now seen corresponding path program 2 times [2018-12-09 00:55:28,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:28,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:28,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:28,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:28,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:55:28,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:55:28,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:55:28,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-09 00:55:28,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:55:28,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:55:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 00:55:28,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:55:28,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-12-09 00:55:28,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:55:28,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:55:28,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:55:28,470 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 7 states. [2018-12-09 00:55:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:28,510 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-12-09 00:55:28,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:55:28,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-09 00:55:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:28,511 INFO L225 Difference]: With dead ends: 84 [2018-12-09 00:55:28,511 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 00:55:28,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:55:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 00:55:28,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 49. [2018-12-09 00:55:28,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 00:55:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2018-12-09 00:55:28,516 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 17 [2018-12-09 00:55:28,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:28,516 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2018-12-09 00:55:28,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:55:28,516 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2018-12-09 00:55:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 00:55:28,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:28,517 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:28,517 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:28,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:28,518 INFO L82 PathProgramCache]: Analyzing trace with hash -393244830, now seen corresponding path program 1 times [2018-12-09 00:55:28,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:28,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:28,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:55:28,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:28,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:55:28,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:55:28,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:55:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:28,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:55:28,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-09 00:55:28,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:55:28,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:55:28,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:55:28,571 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand 6 states. [2018-12-09 00:55:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:28,601 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2018-12-09 00:55:28,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:55:28,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 00:55:28,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:28,601 INFO L225 Difference]: With dead ends: 82 [2018-12-09 00:55:28,602 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 00:55:28,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:55:28,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 00:55:28,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-09 00:55:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 00:55:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-12-09 00:55:28,607 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 20 [2018-12-09 00:55:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:28,607 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-12-09 00:55:28,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:55:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-12-09 00:55:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 00:55:28,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:28,608 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:28,608 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:28,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:28,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2008661593, now seen corresponding path program 1 times [2018-12-09 00:55:28,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:28,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:28,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:28,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:28,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:55:28,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:55:28,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:55:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:28,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:55:28,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-12-09 00:55:28,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:55:28,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:55:28,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:55:28,692 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 10 states. [2018-12-09 00:55:28,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:28,882 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2018-12-09 00:55:28,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 00:55:28,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-09 00:55:28,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:28,883 INFO L225 Difference]: With dead ends: 180 [2018-12-09 00:55:28,883 INFO L226 Difference]: Without dead ends: 179 [2018-12-09 00:55:28,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2018-12-09 00:55:28,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-09 00:55:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 91. [2018-12-09 00:55:28,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-09 00:55:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2018-12-09 00:55:28,891 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 21 [2018-12-09 00:55:28,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:28,891 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2018-12-09 00:55:28,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:55:28,892 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2018-12-09 00:55:28,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:55:28,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:28,892 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:28,893 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:28,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:28,893 INFO L82 PathProgramCache]: Analyzing trace with hash 110861006, now seen corresponding path program 2 times [2018-12-09 00:55:28,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:28,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:28,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:28,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:55:28,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:55:28,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:55:28,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:55:28,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-09 00:55:28,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:55:28,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:55:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 00:55:28,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:55:28,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-12-09 00:55:28,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:55:28,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:55:28,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:55:28,967 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 7 states. [2018-12-09 00:55:29,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:29,017 INFO L93 Difference]: Finished difference Result 184 states and 223 transitions. [2018-12-09 00:55:29,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:55:29,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-09 00:55:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:29,018 INFO L225 Difference]: With dead ends: 184 [2018-12-09 00:55:29,018 INFO L226 Difference]: Without dead ends: 183 [2018-12-09 00:55:29,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:55:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-09 00:55:29,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 54. [2018-12-09 00:55:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 00:55:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-12-09 00:55:29,027 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 23 [2018-12-09 00:55:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:29,027 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-12-09 00:55:29,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:55:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-12-09 00:55:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 00:55:29,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:29,028 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:29,028 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:29,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:29,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1816883499, now seen corresponding path program 1 times [2018-12-09 00:55:29,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:29,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:29,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:29,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:55:29,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:55:29,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:55:29,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:55:29,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:29,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:55:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:55:29,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:55:29,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-09 00:55:29,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:55:29,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:55:29,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:55:29,104 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 9 states. [2018-12-09 00:55:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:29,250 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2018-12-09 00:55:29,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 00:55:29,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-12-09 00:55:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:29,251 INFO L225 Difference]: With dead ends: 150 [2018-12-09 00:55:29,251 INFO L226 Difference]: Without dead ends: 149 [2018-12-09 00:55:29,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2018-12-09 00:55:29,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-09 00:55:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 59. [2018-12-09 00:55:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 00:55:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2018-12-09 00:55:29,260 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 37 [2018-12-09 00:55:29,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:29,260 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2018-12-09 00:55:29,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:55:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2018-12-09 00:55:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 00:55:29,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:29,261 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:29,262 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:29,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:29,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1993669351, now seen corresponding path program 2 times [2018-12-09 00:55:29,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:29,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:29,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:29,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:55:29,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:55:29,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:55:29,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:55:29,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:55:29,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:55:29,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:55:29,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:55:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:55:29,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:55:29,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-09 00:55:29,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:55:29,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:55:29,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:55:29,353 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 10 states. [2018-12-09 00:55:29,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:29,515 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2018-12-09 00:55:29,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 00:55:29,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-12-09 00:55:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:29,516 INFO L225 Difference]: With dead ends: 165 [2018-12-09 00:55:29,516 INFO L226 Difference]: Without dead ends: 164 [2018-12-09 00:55:29,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2018-12-09 00:55:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-09 00:55:29,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 64. [2018-12-09 00:55:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 00:55:29,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-12-09 00:55:29,523 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 42 [2018-12-09 00:55:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:29,523 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-12-09 00:55:29,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:55:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-12-09 00:55:29,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 00:55:29,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:29,524 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:29,524 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:29,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:29,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1342010563, now seen corresponding path program 3 times [2018-12-09 00:55:29,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:29,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:29,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:29,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:55:29,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 00:55:29,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:55:29,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:55:29,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:55:29,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:55:29,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:55:29,549 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2018-12-09 00:55:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:29,606 INFO L93 Difference]: Finished difference Result 151 states and 176 transitions. [2018-12-09 00:55:29,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:55:29,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-12-09 00:55:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:29,607 INFO L225 Difference]: With dead ends: 151 [2018-12-09 00:55:29,607 INFO L226 Difference]: Without dead ends: 106 [2018-12-09 00:55:29,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:55:29,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-09 00:55:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2018-12-09 00:55:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 00:55:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2018-12-09 00:55:29,616 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 43 [2018-12-09 00:55:29,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:29,616 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2018-12-09 00:55:29,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:55:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2018-12-09 00:55:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 00:55:29,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:55:29,617 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:55:29,617 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 00:55:29,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:55:29,618 INFO L82 PathProgramCache]: Analyzing trace with hash -23891545, now seen corresponding path program 4 times [2018-12-09 00:55:29,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:55:29,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:55:29,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:29,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:55:29,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:55:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:55:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:55:29,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:55:29,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:55:29,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 00:55:29,689 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 00:55:29,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:55:29,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:55:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 00:55:29,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:55:29,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2018-12-09 00:55:29,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 00:55:29,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 00:55:29,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:55:29,746 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 13 states. [2018-12-09 00:55:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:55:29,947 INFO L93 Difference]: Finished difference Result 163 states and 180 transitions. [2018-12-09 00:55:29,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 00:55:29,948 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-12-09 00:55:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:55:29,948 INFO L225 Difference]: With dead ends: 163 [2018-12-09 00:55:29,948 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:55:29,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=536, Unknown=0, NotChecked=0, Total=812 [2018-12-09 00:55:29,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:55:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:55:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:55:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:55:29,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-12-09 00:55:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:55:29,949 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:55:29,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 00:55:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:55:29,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:55:29,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 00:55:29,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:29,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,059 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 126 [2018-12-09 00:55:30,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,196 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 128 [2018-12-09 00:55:30,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:55:30,626 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 36 [2018-12-09 00:55:30,944 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 28 [2018-12-09 00:55:31,212 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 26 [2018-12-09 00:55:31,215 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 00:55:31,215 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:55:31,215 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:55:31,216 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 00:55:31,216 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 00:55:31,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:55:31,216 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 13 37) no Hoare annotation was computed. [2018-12-09 00:55:31,216 INFO L444 ceAbstractionStarter]: At program point L23-2(lines 23 34) the Hoare annotation is: (let ((.cse1 (<= 0 main_~i~0)) (.cse5 (<= 0 main_~j~0)) (.cse0 (<= main_~n~0 2147483647)) (.cse6 (<= main_~m~0 main_~j~0)) (.cse2 (<= main_~N~0 2147483647)) (.cse3 (<= 0 main_~N~0)) (.cse4 (<= main_~m~0 2147483647))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= main_~i~0 0)) (and .cse5 .cse0 .cse1 .cse6 .cse2 .cse3 (<= main_~j~0 0)) (and (<= main_~N~0 (+ main_~k~0 1)) (and .cse5 .cse0 .cse6 .cse2 .cse3 .cse4) (<= main_~N~0 main_~i~0)))) [2018-12-09 00:55:31,216 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2018-12-09 00:55:31,217 INFO L448 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2018-12-09 00:55:31,217 INFO L448 ceAbstractionStarter]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2018-12-09 00:55:31,217 INFO L444 ceAbstractionStarter]: At program point L28-4(lines 28 30) the Hoare annotation is: (let ((.cse0 (and (and (<= 0 main_~j~0) (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~N~0 2147483647) (<= 0 main_~N~0) (<= main_~k~0 2147483646)) (<= main_~m~0 2147483647)))) (or (and .cse0 (<= main_~i~0 0)) (and .cse0 (<= main_~N~0 (+ main_~k~0 1)) (<= main_~N~0 (+ main_~i~0 1))))) [2018-12-09 00:55:31,217 INFO L448 ceAbstractionStarter]: For program point L28-5(lines 28 30) no Hoare annotation was computed. [2018-12-09 00:55:31,218 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-12-09 00:55:31,218 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2018-12-09 00:55:31,218 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-12-09 00:55:31,218 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2018-12-09 00:55:31,218 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-12-09 00:55:31,218 INFO L448 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2018-12-09 00:55:31,219 INFO L444 ceAbstractionStarter]: At program point L25-2(lines 25 32) the Hoare annotation is: (let ((.cse4 (<= 0 main_~j~0)) (.cse5 (<= main_~n~0 2147483647)) (.cse6 (<= 0 main_~i~0)) (.cse7 (<= main_~N~0 2147483647)) (.cse9 (<= main_~i~0 2147483646)) (.cse8 (<= 0 main_~N~0))) (let ((.cse3 (<= main_~N~0 (+ main_~k~0 1))) (.cse0 (<= main_~m~0 2147483647)) (.cse2 (and .cse4 .cse5 .cse6 .cse7 .cse9 .cse8)) (.cse1 (<= main_~j~0 0))) (or (and (and .cse0 .cse1 .cse2) .cse3 (<= main_~N~0 main_~i~0)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse1 (<= main_~i~0 0)) (and .cse3 (and (and .cse4 .cse5 .cse6 (<= 0 main_~k~0) .cse9 .cse8 (<= main_~k~0 2147483646)) .cse0) (<= main_~N~0 (+ main_~i~0 1))) (and (<= main_~m~0 0) .cse2 .cse1)))) [2018-12-09 00:55:31,219 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-12-09 00:55:31,219 INFO L448 ceAbstractionStarter]: For program point L25-3(lines 25 32) no Hoare annotation was computed. [2018-12-09 00:55:31,219 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 35) no Hoare annotation was computed. [2018-12-09 00:55:31,219 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 21 35) no Hoare annotation was computed. [2018-12-09 00:55:31,219 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2018-12-09 00:55:31,219 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 13 37) no Hoare annotation was computed. [2018-12-09 00:55:31,219 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2018-12-09 00:55:31,220 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 13 37) the Hoare annotation is: true [2018-12-09 00:55:31,220 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-12-09 00:55:31,220 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-12-09 00:55:31,220 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2018-12-09 00:55:31,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:55:31 BoogieIcfgContainer [2018-12-09 00:55:31,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:55:31,240 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:55:31,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:55:31,241 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:55:31,241 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:55:27" (3/4) ... [2018-12-09 00:55:31,245 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:55:31,251 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:55:31,251 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:55:31,254 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 00:55:31,254 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-09 00:55:31,254 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 00:55:31,254 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 00:55:31,285 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_96736f0d-a576-43c5-9355-7e02716326f7/bin-2019/uautomizer/witness.graphml [2018-12-09 00:55:31,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:55:31,286 INFO L168 Benchmark]: Toolchain (without parser) took 3959.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 962.4 MB in the beginning and 1.1 GB in the end (delta: -99.3 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:55:31,287 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:55:31,287 INFO L168 Benchmark]: CACSL2BoogieTranslator took 117.47 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:55:31,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.81 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:55:31,287 INFO L168 Benchmark]: Boogie Preprocessor took 12.61 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 946.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:55:31,288 INFO L168 Benchmark]: RCFGBuilder took 172.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:55:31,288 INFO L168 Benchmark]: TraceAbstraction took 3596.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.7 MB). Peak memory consumption was 294.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:55:31,288 INFO L168 Benchmark]: Witness Printer took 45.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:55:31,290 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 117.47 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 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 11.81 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.61 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 946.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 172.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3596.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.7 MB). Peak memory consumption was 294.0 MB. Max. memory is 11.5 GB. * Witness Printer took 45.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: 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: 29]: 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 8 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((((m <= 2147483647 && j <= 0) && ((((0 <= j && n <= 2147483647) && 0 <= i) && N <= 2147483647) && i <= 2147483646) && 0 <= N) && N <= k + 1) && N <= i) || (((((((0 <= j && n <= 2147483647) && 0 <= i) && N <= 2147483647) && 0 <= N) && m <= 2147483647) && j <= 0) && i <= 0)) || ((N <= k + 1 && ((((((0 <= j && n <= 2147483647) && 0 <= i) && 0 <= k) && i <= 2147483646) && 0 <= N) && k <= 2147483646) && m <= 2147483647) && N <= i + 1)) || ((m <= 0 && ((((0 <= j && n <= 2147483647) && 0 <= i) && N <= 2147483647) && i <= 2147483646) && 0 <= N) && j <= 0) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((((0 <= j && n <= 2147483647) && 0 <= i) && 0 <= k) && N <= 2147483647) && 0 <= N) && k <= 2147483646) && m <= 2147483647) && i <= 0) || (((((((((0 <= j && n <= 2147483647) && 0 <= i) && 0 <= k) && N <= 2147483647) && 0 <= N) && k <= 2147483646) && m <= 2147483647) && N <= k + 1) && N <= i + 1) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((n <= 2147483647 && 0 <= i) && N <= 2147483647) && 0 <= N) && m <= 2147483647) && i <= 0) || ((((((0 <= j && n <= 2147483647) && 0 <= i) && m <= j) && N <= 2147483647) && 0 <= N) && j <= 0)) || ((N <= k + 1 && ((((0 <= j && n <= 2147483647) && m <= j) && N <= 2147483647) && 0 <= N) && m <= 2147483647) && N <= i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 8 error locations. SAFE Result, 3.5s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 389 SDtfs, 1048 SDslu, 673 SDs, 0 SdLazy, 666 SolverSat, 261 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 565 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 54 NumberOfFragments, 266 HoareAnnotationTreeSize, 7 FomulaSimplifications, 2973961 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 657913 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 622 NumberOfCodeBlocks, 600 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 593 ConstructedInterpolants, 0 QuantifiedInterpolants, 39971 SizeOfPredicates, 18 NumberOfNonLiveVariables, 613 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 103/374 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...