./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-numeric/MultCommutative_false-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_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a7af5709195f6c1eec73f2559f8e654af4840835 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:13:46,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:13:46,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:13:46,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:13:46,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:13:46,586 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:13:46,587 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:13:46,588 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:13:46,588 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:13:46,589 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:13:46,589 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:13:46,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:13:46,590 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:13:46,590 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:13:46,591 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:13:46,591 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:13:46,591 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:13:46,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:13:46,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:13:46,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:13:46,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:13:46,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:13:46,596 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:13:46,596 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:13:46,596 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:13:46,597 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:13:46,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:13:46,598 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:13:46,598 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:13:46,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:13:46,599 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:13:46,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:13:46,599 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:13:46,599 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:13:46,600 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:13:46,600 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:13:46,600 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-12-02 02:13:46,607 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:13:46,607 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:13:46,607 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:13:46,608 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:13:46,608 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 02:13:46,608 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 02:13:46,608 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 02:13:46,608 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 02:13:46,608 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 02:13:46,608 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 02:13:46,608 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 02:13:46,608 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 02:13:46,608 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 02:13:46,609 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:13:46,609 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 02:13:46,609 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:13:46,609 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:13:46,609 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 02:13:46,609 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:13:46,609 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 02:13:46,609 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-02 02:13:46,609 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:13:46,609 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 02:13:46,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:13:46,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:13:46,610 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:13:46,610 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:13:46,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:13:46,610 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:13:46,610 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:13:46,610 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 02:13:46,610 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 02:13:46,610 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:13:46,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 02:13:46,610 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 02:13:46,610 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7af5709195f6c1eec73f2559f8e654af4840835 [2018-12-02 02:13:46,628 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:13:46,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:13:46,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:13:46,640 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:13:46,640 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:13:46,641 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/../../sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c [2018-12-02 02:13:46,679 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/data/b6f4cae27/5ca93dd71e444e77b337e3d855f16417/FLAGe5554e7a7 [2018-12-02 02:13:47,028 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:13:47,028 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c [2018-12-02 02:13:47,032 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/data/b6f4cae27/5ca93dd71e444e77b337e3d855f16417/FLAGe5554e7a7 [2018-12-02 02:13:47,039 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/data/b6f4cae27/5ca93dd71e444e77b337e3d855f16417 [2018-12-02 02:13:47,041 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:13:47,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:13:47,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:13:47,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:13:47,045 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:13:47,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:13:47" (1/1) ... [2018-12-02 02:13:47,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d10e54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:47, skipping insertion in model container [2018-12-02 02:13:47,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:13:47" (1/1) ... [2018-12-02 02:13:47,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:13:47,060 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:13:47,141 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:13:47,143 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:13:47,152 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:13:47,160 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:13:47,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:47 WrapperNode [2018-12-02 02:13:47,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:13:47,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:13:47,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:13:47,161 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:13:47,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:47" (1/1) ... [2018-12-02 02:13:47,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:47" (1/1) ... [2018-12-02 02:13:47,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:13:47,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:13:47,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:13:47,172 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:13:47,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:47" (1/1) ... [2018-12-02 02:13:47,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:47" (1/1) ... [2018-12-02 02:13:47,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:47" (1/1) ... [2018-12-02 02:13:47,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:47" (1/1) ... [2018-12-02 02:13:47,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:47" (1/1) ... [2018-12-02 02:13:47,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:47" (1/1) ... [2018-12-02 02:13:47,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:47" (1/1) ... [2018-12-02 02:13:47,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:13:47,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:13:47,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:13:47,183 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:13:47,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:13:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 02:13:47,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 02:13:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2018-12-02 02:13:47,242 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2018-12-02 02:13:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:13:47,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:13:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 02:13:47,242 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 02:13:47,343 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:13:47,343 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 02:13:47,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:13:47 BoogieIcfgContainer [2018-12-02 02:13:47,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:13:47,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:13:47,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:13:47,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:13:47,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:13:47" (1/3) ... [2018-12-02 02:13:47,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5ac7a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:13:47, skipping insertion in model container [2018-12-02 02:13:47,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:47" (2/3) ... [2018-12-02 02:13:47,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5ac7a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:13:47, skipping insertion in model container [2018-12-02 02:13:47,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:13:47" (3/3) ... [2018-12-02 02:13:47,348 INFO L112 eAbstractionObserver]: Analyzing ICFG MultCommutative_false-no-overflow.c [2018-12-02 02:13:47,354 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:13:47,358 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-12-02 02:13:47,368 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-12-02 02:13:47,387 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:13:47,387 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 02:13:47,387 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:13:47,387 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:13:47,387 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:13:47,388 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:13:47,388 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:13:47,388 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:13:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-12-02 02:13:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 02:13:47,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:13:47,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:13:47,404 INFO L423 AbstractCegarLoop]: === Iteration 1 === [multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 02:13:47,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:13:47,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1930860990, now seen corresponding path program 1 times [2018-12-02 02:13:47,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:13:47,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:47,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:13:47,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:47,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:13:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:13:47,512 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-02 02:13:47,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:13:47,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:13:47,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:13:47,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:13:47,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:13:47,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:13:47,525 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-12-02 02:13:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:13:47,603 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2018-12-02 02:13:47,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:13:47,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-02 02:13:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:13:47,610 INFO L225 Difference]: With dead ends: 85 [2018-12-02 02:13:47,610 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 02:13:47,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:13:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 02:13:47,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-12-02 02:13:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 02:13:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-12-02 02:13:47,638 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 11 [2018-12-02 02:13:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:13:47,639 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-12-02 02:13:47,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:13:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-12-02 02:13:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 02:13:47,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:13:47,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:13:47,639 INFO L423 AbstractCegarLoop]: === Iteration 2 === [multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 02:13:47,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:13:47,640 INFO L82 PathProgramCache]: Analyzing trace with hash -272844401, now seen corresponding path program 1 times [2018-12-02 02:13:47,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:13:47,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:47,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:13:47,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:47,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:13:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:13:47,667 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-02 02:13:47,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:13:47,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:13:47,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:13:47,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:13:47,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:13:47,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:13:47,669 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 5 states. [2018-12-02 02:13:47,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:13:47,716 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2018-12-02 02:13:47,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:13:47,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-12-02 02:13:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:13:47,717 INFO L225 Difference]: With dead ends: 62 [2018-12-02 02:13:47,717 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 02:13:47,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:13:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 02:13:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-12-02 02:13:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 02:13:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2018-12-02 02:13:47,724 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 12 [2018-12-02 02:13:47,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:13:47,724 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2018-12-02 02:13:47,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:13:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2018-12-02 02:13:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 02:13:47,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:13:47,725 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:13:47,725 INFO L423 AbstractCegarLoop]: === Iteration 3 === [multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 02:13:47,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:13:47,725 INFO L82 PathProgramCache]: Analyzing trace with hash 757868177, now seen corresponding path program 1 times [2018-12-02 02:13:47,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:13:47,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:47,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:13:47,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:47,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:13:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:13:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:13:47,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:13:47,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:13:47,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:13:47,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:13:47,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:13:47,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:13:47,750 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand 5 states. [2018-12-02 02:13:47,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:13:47,800 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2018-12-02 02:13:47,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:13:47,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 02:13:47,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:13:47,801 INFO L225 Difference]: With dead ends: 80 [2018-12-02 02:13:47,801 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 02:13:47,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:13:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 02:13:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-12-02 02:13:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-02 02:13:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-12-02 02:13:47,809 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 17 [2018-12-02 02:13:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:13:47,809 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-12-02 02:13:47,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:13:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-12-02 02:13:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 02:13:47,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:13:47,809 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:13:47,810 INFO L423 AbstractCegarLoop]: === Iteration 4 === [multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 02:13:47,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:13:47,810 INFO L82 PathProgramCache]: Analyzing trace with hash 809703757, now seen corresponding path program 1 times [2018-12-02 02:13:47,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:13:47,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:47,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:13:47,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:47,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:13:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:13:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:13:47,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:13:47,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:13:47,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:13:47,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:13:47,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:13:47,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:13:47,839 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 5 states. [2018-12-02 02:13:47,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:13:47,874 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2018-12-02 02:13:47,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:13:47,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-02 02:13:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:13:47,876 INFO L225 Difference]: With dead ends: 124 [2018-12-02 02:13:47,876 INFO L226 Difference]: Without dead ends: 88 [2018-12-02 02:13:47,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:13:47,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-02 02:13:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2018-12-02 02:13:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 02:13:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2018-12-02 02:13:47,884 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 18 [2018-12-02 02:13:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:13:47,884 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2018-12-02 02:13:47,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:13:47,884 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2018-12-02 02:13:47,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 02:13:47,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:13:47,884 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:13:47,885 INFO L423 AbstractCegarLoop]: === Iteration 5 === [multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 02:13:47,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:13:47,885 INFO L82 PathProgramCache]: Analyzing trace with hash -668980256, now seen corresponding path program 1 times [2018-12-02 02:13:47,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:13:47,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:47,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:13:47,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:47,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:13:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:13:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:13:47,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:13:47,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:13:47,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:13:47,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:13:47,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:13:47,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:13:47,906 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 5 states. [2018-12-02 02:13:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:13:47,949 INFO L93 Difference]: Finished difference Result 105 states and 134 transitions. [2018-12-02 02:13:47,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:13:47,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-02 02:13:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:13:47,951 INFO L225 Difference]: With dead ends: 105 [2018-12-02 02:13:47,951 INFO L226 Difference]: Without dead ends: 104 [2018-12-02 02:13:47,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:13:47,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-02 02:13:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-12-02 02:13:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-02 02:13:47,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2018-12-02 02:13:47,960 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 19 [2018-12-02 02:13:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:13:47,960 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2018-12-02 02:13:47,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:13:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2018-12-02 02:13:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 02:13:47,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:13:47,961 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:13:47,961 INFO L423 AbstractCegarLoop]: === Iteration 6 === [multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 02:13:47,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:13:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2531206, now seen corresponding path program 1 times [2018-12-02 02:13:47,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:13:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:47,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:13:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:47,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:13:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:13:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:13:47,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:13:47,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:13:47,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:13:47,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:13:47,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:13:47,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:13:47,989 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 5 states. [2018-12-02 02:13:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:13:48,015 INFO L93 Difference]: Finished difference Result 136 states and 172 transitions. [2018-12-02 02:13:48,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:13:48,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-02 02:13:48,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:13:48,017 INFO L225 Difference]: With dead ends: 136 [2018-12-02 02:13:48,017 INFO L226 Difference]: Without dead ends: 62 [2018-12-02 02:13:48,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:13:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-02 02:13:48,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-12-02 02:13:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 02:13:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-12-02 02:13:48,022 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 22 [2018-12-02 02:13:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:13:48,023 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-12-02 02:13:48,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:13:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-12-02 02:13:48,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 02:13:48,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:13:48,023 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-02 02:13:48,023 INFO L423 AbstractCegarLoop]: === Iteration 7 === [multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 02:13:48,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:13:48,023 INFO L82 PathProgramCache]: Analyzing trace with hash -484323025, now seen corresponding path program 1 times [2018-12-02 02:13:48,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:13:48,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:48,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:13:48,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:48,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:13:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:13:48,069 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-02 02:13:48,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:13:48,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:13:48,070 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 02:13:48,071 INFO L205 CegarAbsIntRunner]: [0], [1], [11], [14], [15], [17], [19], [21], [22], [26], [30], [34], [38], [52], [53], [54], [55], [56], [58] [2018-12-02 02:13:48,094 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:13:48,094 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:13:48,192 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:13:48,193 INFO L272 AbstractInterpreter]: Visited 19 different actions 49 times. Never merged. Never widened. Performed 124 root evaluator evaluations with a maximum evaluation depth of 3. Performed 124 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-12-02 02:13:48,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:13:48,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:13:48,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:13:48,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:13:48,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:13:48,207 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:13:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:13:48,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:13:48,254 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-02 02:13:48,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:13:48,291 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-02 02:13:48,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:13:48,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2018-12-02 02:13:48,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:13:48,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:13:48,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:13:48,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:13:48,308 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 8 states. [2018-12-02 02:13:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:13:48,387 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-12-02 02:13:48,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 02:13:48,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-12-02 02:13:48,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:13:48,388 INFO L225 Difference]: With dead ends: 70 [2018-12-02 02:13:48,388 INFO L226 Difference]: Without dead ends: 69 [2018-12-02 02:13:48,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 02:13:48,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-02 02:13:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2018-12-02 02:13:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 02:13:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-12-02 02:13:48,394 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 21 [2018-12-02 02:13:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:13:48,394 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-12-02 02:13:48,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:13:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-12-02 02:13:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 02:13:48,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:13:48,395 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:13:48,395 INFO L423 AbstractCegarLoop]: === Iteration 8 === [multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 02:13:48,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:13:48,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2129111832, now seen corresponding path program 1 times [2018-12-02 02:13:48,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:13:48,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:48,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:13:48,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:48,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:13:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:13:48,422 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-02 02:13:48,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:13:48,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:13:48,422 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-02 02:13:48,423 INFO L205 CegarAbsIntRunner]: [0], [1], [11], [14], [15], [17], [19], [21], [23], [24], [26], [30], [34], [38], [52], [53], [54], [55], [56], [58] [2018-12-02 02:13:48,424 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:13:48,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:13:48,458 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:13:48,459 INFO L272 AbstractInterpreter]: Visited 20 different actions 52 times. Never merged. Never widened. Performed 130 root evaluator evaluations with a maximum evaluation depth of 4. Performed 130 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-12-02 02:13:48,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:13:48,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:13:48,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:13:48,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:13:48,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:13:48,466 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:13:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:13:48,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:13:48,485 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-02 02:13:48,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:13:48,503 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-02 02:13:48,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:13:48,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2018-12-02 02:13:48,520 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:13:48,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:13:48,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:13:48,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:13:48,520 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 7 states. [2018-12-02 02:13:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:13:48,577 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-12-02 02:13:48,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:13:48,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-02 02:13:48,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:13:48,577 INFO L225 Difference]: With dead ends: 62 [2018-12-02 02:13:48,578 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 02:13:48,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:13:48,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 02:13:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-12-02 02:13:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 02:13:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-12-02 02:13:48,582 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 22 [2018-12-02 02:13:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:13:48,582 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-12-02 02:13:48,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:13:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-12-02 02:13:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 02:13:48,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:13:48,583 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:13:48,583 INFO L423 AbstractCegarLoop]: === Iteration 9 === [multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 02:13:48,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:13:48,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1178899970, now seen corresponding path program 1 times [2018-12-02 02:13:48,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:13:48,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:48,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:13:48,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:48,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:13:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:13:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 02:13:48,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:13:48,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:13:48,627 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-02 02:13:48,627 INFO L205 CegarAbsIntRunner]: [0], [1], [11], [14], [15], [17], [19], [21], [22], [26], [30], [34], [38], [40], [52], [53], [54], [55], [56], [58], [59], [60] [2018-12-02 02:13:48,628 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:13:48,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:13:48,672 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:13:48,672 INFO L272 AbstractInterpreter]: Visited 22 different actions 93 times. Never merged. Never widened. Performed 240 root evaluator evaluations with a maximum evaluation depth of 3. Performed 240 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 1 different actions. Largest state had 6 variables. [2018-12-02 02:13:48,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:13:48,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:13:48,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:13:48,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/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-02 02:13:48,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:13:48,679 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:13:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:13:48,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:13:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:13:48,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:13:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:13:48,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:13:48,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2018-12-02 02:13:48,816 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:13:48,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 02:13:48,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 02:13:48,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-12-02 02:13:48,817 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 13 states. [2018-12-02 02:13:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:13:48,981 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2018-12-02 02:13:48,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 02:13:48,981 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-12-02 02:13:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:13:48,982 INFO L225 Difference]: With dead ends: 97 [2018-12-02 02:13:48,982 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 02:13:48,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-12-02 02:13:48,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 02:13:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-12-02 02:13:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 02:13:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2018-12-02 02:13:48,987 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 28 [2018-12-02 02:13:48,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:13:48,987 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2018-12-02 02:13:48,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 02:13:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2018-12-02 02:13:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 02:13:48,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:13:48,988 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:13:48,988 INFO L423 AbstractCegarLoop]: === Iteration 10 === [multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 02:13:48,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:13:48,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2108806649, now seen corresponding path program 1 times [2018-12-02 02:13:48,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:13:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:48,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:13:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:48,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:13:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:13:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 02:13:49,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:13:49,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:13:49,012 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-12-02 02:13:49,012 INFO L205 CegarAbsIntRunner]: [0], [1], [11], [14], [15], [17], [19], [21], [23], [24], [26], [30], [34], [38], [40], [52], [53], [54], [55], [56], [58], [59], [60] [2018-12-02 02:13:49,013 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:13:49,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:13:49,051 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:13:49,051 INFO L272 AbstractInterpreter]: Visited 23 different actions 99 times. Never merged. Never widened. Performed 252 root evaluator evaluations with a maximum evaluation depth of 4. Performed 252 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 1 different actions. Largest state had 6 variables. [2018-12-02 02:13:49,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:13:49,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:13:49,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:13:49,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:13:49,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:13:49,058 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:13:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:13:49,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:13:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 02:13:49,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:13:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 02:13:49,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:13:49,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2018-12-02 02:13:49,112 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:13:49,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:13:49,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:13:49,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:13:49,113 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand 7 states. [2018-12-02 02:13:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:13:49,139 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2018-12-02 02:13:49,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:13:49,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-12-02 02:13:49,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:13:49,140 INFO L225 Difference]: With dead ends: 88 [2018-12-02 02:13:49,140 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 02:13:49,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:13:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 02:13:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-12-02 02:13:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 02:13:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-12-02 02:13:49,143 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 29 [2018-12-02 02:13:49,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:13:49,143 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-12-02 02:13:49,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:13:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-12-02 02:13:49,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 02:13:49,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:13:49,144 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:13:49,144 INFO L423 AbstractCegarLoop]: === Iteration 11 === [multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 02:13:49,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:13:49,144 INFO L82 PathProgramCache]: Analyzing trace with hash -880204174, now seen corresponding path program 1 times [2018-12-02 02:13:49,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:13:49,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:49,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:13:49,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:13:49,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:13:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:13:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:13:49,166 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 02:13:49,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:13:49 BoogieIcfgContainer [2018-12-02 02:13:49,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 02:13:49,182 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:13:49,182 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:13:49,182 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:13:49,182 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:13:47" (3/4) ... [2018-12-02 02:13:49,184 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 02:13:49,208 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b6b1e02a-b8bc-4ff8-bea3-76065b3974d8/bin-2019/utaipan/witness.graphml [2018-12-02 02:13:49,208 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:13:49,208 INFO L168 Benchmark]: Toolchain (without parser) took 2166.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 952.4 MB in the beginning and 1.2 GB in the end (delta: -223.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:13:49,209 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:13:49,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 117.51 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 940.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-02 02:13:49,209 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.51 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:13:49,209 INFO L168 Benchmark]: Boogie Preprocessor took 10.25 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:13:49,210 INFO L168 Benchmark]: RCFGBuilder took 161.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-02 02:13:49,210 INFO L168 Benchmark]: TraceAbstraction took 1837.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -67.0 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-02 02:13:49,210 INFO L168 Benchmark]: Witness Printer took 25.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:13:49,211 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 117.51 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 940.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.51 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.25 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 161.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1837.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -67.0 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Witness Printer took 25.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 22]: integer overflow possible integer overflow possible We found a FailurePath: [L26] int m = __VERIFIER_nondet_int(); [L27] COND FALSE !(m < 0) [L30] int n = __VERIFIER_nondet_int(); [L31] COND FALSE !(n < 0) VAL [m=1073741824, n=2] [L34] CALL mult(m, n) VAL [\old(m)=2, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L19] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L22] EXPR m - 1 VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L19] COND FALSE !(m == 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L22] EXPR m - 1 VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=0, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=0, \old(n)=1073741824, m=0, n=1073741824] [L19] COND TRUE m == 0 [L20] return 0; VAL [\old(m)=0, \old(n)=1073741824, \result=0, m=0, n=1073741824] [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824, m=1, mult(n, m - 1)=0, n=1073741824] [L22] EXPR n + mult(n, m - 1) [L22] return n + mult(n, m - 1); [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824] [L22] n + mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 6 error locations. UNSAFE Result, 1.7s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 284 SDtfs, 311 SDslu, 748 SDs, 0 SdLazy, 596 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 191 SyntacticMatches, 17 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 66 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 19117 SizeOfPredicates, 12 NumberOfNonLiveVariables, 266 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 50/98 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...