./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/recursive/MultCommutative_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/MultCommutative_true-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a755472942b72da612d26a2f3af20ed4332f07b5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:25:02,341 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:25:02,342 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:25:02,350 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:25:02,350 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:25:02,351 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:25:02,352 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:25:02,353 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:25:02,354 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:25:02,355 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:25:02,355 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:25:02,355 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:25:02,356 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:25:02,357 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:25:02,357 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:25:02,358 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:25:02,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:25:02,359 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:25:02,360 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:25:02,361 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:25:02,362 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:25:02,363 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:25:02,364 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:25:02,364 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:25:02,364 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:25:02,365 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:25:02,365 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:25:02,366 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:25:02,366 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:25:02,366 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:25:02,367 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:25:02,367 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:25:02,367 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:25:02,367 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:25:02,367 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:25:02,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:25:02,368 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-11-10 13:25:02,375 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:25:02,375 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:25:02,375 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:25:02,376 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:25:02,376 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:25:02,376 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:25:02,376 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:25:02,376 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:25:02,376 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:25:02,376 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:25:02,377 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:25:02,377 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:25:02,377 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:25:02,377 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:25:02,378 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:25:02,378 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:25:02,378 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:25:02,378 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:25:02,378 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:25:02,378 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:25:02,379 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 13:25:02,379 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:25:02,379 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:25:02,379 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:25:02,379 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:25:02,379 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:25:02,379 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:25:02,380 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:25:02,380 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:25:02,380 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:25:02,380 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:25:02,380 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:25:02,380 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:25:02,380 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:25:02,380 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:25:02,380 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 13:25:02,380 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_0200f16a-b003-4786-9665-9abb4e6e7df6/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a755472942b72da612d26a2f3af20ed4332f07b5 [2018-11-10 13:25:02,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:25:02,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:25:02,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:25:02,415 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:25:02,416 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:25:02,416 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/bin-2019/utaipan/../../sv-benchmarks/c/recursive/MultCommutative_true-unreach-call_true-no-overflow_true-termination.c [2018-11-10 13:25:02,462 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/bin-2019/utaipan/data/de162b431/9def27cdff48455ea62fffcc23fe8a1e/FLAG5c27d2be1 [2018-11-10 13:25:02,854 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:25:02,854 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/sv-benchmarks/c/recursive/MultCommutative_true-unreach-call_true-no-overflow_true-termination.c [2018-11-10 13:25:02,858 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/bin-2019/utaipan/data/de162b431/9def27cdff48455ea62fffcc23fe8a1e/FLAG5c27d2be1 [2018-11-10 13:25:02,868 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/bin-2019/utaipan/data/de162b431/9def27cdff48455ea62fffcc23fe8a1e [2018-11-10 13:25:02,871 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:25:02,872 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:25:02,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:25:02,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:25:02,875 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:25:02,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:25:02" (1/1) ... [2018-11-10 13:25:02,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5adf90f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:02, skipping insertion in model container [2018-11-10 13:25:02,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:25:02" (1/1) ... [2018-11-10 13:25:02,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:25:02,895 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:25:02,993 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:25:02,996 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:25:03,007 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:25:03,015 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:25:03,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:03 WrapperNode [2018-11-10 13:25:03,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:25:03,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:25:03,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:25:03,016 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:25:03,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:03" (1/1) ... [2018-11-10 13:25:03,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:03" (1/1) ... [2018-11-10 13:25:03,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:25:03,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:25:03,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:25:03,029 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:25:03,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:03" (1/1) ... [2018-11-10 13:25:03,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:03" (1/1) ... [2018-11-10 13:25:03,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:03" (1/1) ... [2018-11-10 13:25:03,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:03" (1/1) ... [2018-11-10 13:25:03,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:03" (1/1) ... [2018-11-10 13:25:03,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:03" (1/1) ... [2018-11-10 13:25:03,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:03" (1/1) ... [2018-11-10 13:25:03,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:25:03,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:25:03,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:25:03,041 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:25:03,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/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-11-10 13:25:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:25:03,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:25:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2018-11-10 13:25:03,110 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2018-11-10 13:25:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:25:03,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:25:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:25:03,110 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:25:03,224 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:25:03,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:25:03 BoogieIcfgContainer [2018-11-10 13:25:03,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:25:03,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:25:03,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:25:03,226 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:25:03,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:25:02" (1/3) ... [2018-11-10 13:25:03,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193384ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:25:03, skipping insertion in model container [2018-11-10 13:25:03,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:03" (2/3) ... [2018-11-10 13:25:03,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193384ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:25:03, skipping insertion in model container [2018-11-10 13:25:03,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:25:03" (3/3) ... [2018-11-10 13:25:03,228 INFO L112 eAbstractionObserver]: Analyzing ICFG MultCommutative_true-unreach-call_true-no-overflow_true-termination.c [2018-11-10 13:25:03,234 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:25:03,238 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-10 13:25:03,246 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-10 13:25:03,272 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:25:03,272 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:25:03,272 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:25:03,272 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:25:03,272 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:25:03,272 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:25:03,272 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:25:03,272 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:25:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-10 13:25:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 13:25:03,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:03,294 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:03,296 INFO L424 AbstractCegarLoop]: === Iteration 1 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:25:03,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:03,299 INFO L82 PathProgramCache]: Analyzing trace with hash 69295294, now seen corresponding path program 1 times [2018-11-10 13:25:03,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:25:03,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:03,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:03,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:03,331 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:25:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:03,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:03,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:03,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:25:03,417 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:25:03,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:25:03,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:25:03,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:25:03,428 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-11-10 13:25:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:03,530 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2018-11-10 13:25:03,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:25:03,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-10 13:25:03,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:03,539 INFO L225 Difference]: With dead ends: 85 [2018-11-10 13:25:03,539 INFO L226 Difference]: Without dead ends: 46 [2018-11-10 13:25:03,542 INFO L605 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-11-10 13:25:03,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-10 13:25:03,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-11-10 13:25:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 13:25:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-10 13:25:03,572 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 11 [2018-11-10 13:25:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:03,573 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-10 13:25:03,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:25:03,573 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-10 13:25:03,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 13:25:03,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:03,574 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:03,574 INFO L424 AbstractCegarLoop]: === Iteration 2 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:25:03,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:03,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2146806129, now seen corresponding path program 1 times [2018-11-10 13:25:03,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:25:03,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:03,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:03,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:03,576 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:25:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:03,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:03,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:25:03,623 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:25:03,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:25:03,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:25:03,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:25:03,624 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 5 states. [2018-11-10 13:25:03,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:03,724 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2018-11-10 13:25:03,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:25:03,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-10 13:25:03,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:03,727 INFO L225 Difference]: With dead ends: 62 [2018-11-10 13:25:03,727 INFO L226 Difference]: Without dead ends: 60 [2018-11-10 13:25:03,727 INFO L605 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-11-10 13:25:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-10 13:25:03,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-11-10 13:25:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 13:25:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2018-11-10 13:25:03,736 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 12 [2018-11-10 13:25:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:03,736 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2018-11-10 13:25:03,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:25:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2018-11-10 13:25:03,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 13:25:03,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:03,737 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:03,737 INFO L424 AbstractCegarLoop]: === Iteration 3 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:25:03,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:03,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1378279952, now seen corresponding path program 1 times [2018-11-10 13:25:03,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:25:03,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:03,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:03,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:03,739 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:25:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:03,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:03,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:25:03,764 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:25:03,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:25:03,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:25:03,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:25:03,765 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand 5 states. [2018-11-10 13:25:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:03,821 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2018-11-10 13:25:03,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:25:03,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-10 13:25:03,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:03,822 INFO L225 Difference]: With dead ends: 80 [2018-11-10 13:25:03,823 INFO L226 Difference]: Without dead ends: 79 [2018-11-10 13:25:03,823 INFO L605 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-11-10 13:25:03,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-10 13:25:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-11-10 13:25:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 13:25:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-11-10 13:25:03,830 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 17 [2018-11-10 13:25:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:03,830 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-11-10 13:25:03,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:25:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-11-10 13:25:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 13:25:03,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:03,831 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:03,831 INFO L424 AbstractCegarLoop]: === Iteration 4 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:25:03,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:03,832 INFO L82 PathProgramCache]: Analyzing trace with hash -958643381, now seen corresponding path program 1 times [2018-11-10 13:25:03,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:25:03,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:03,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:03,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:03,833 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:25:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:03,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:03,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:25:03,866 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:25:03,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:25:03,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:25:03,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:25:03,867 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 5 states. [2018-11-10 13:25:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:03,912 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2018-11-10 13:25:03,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:25:03,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-10 13:25:03,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:03,914 INFO L225 Difference]: With dead ends: 124 [2018-11-10 13:25:03,914 INFO L226 Difference]: Without dead ends: 88 [2018-11-10 13:25:03,915 INFO L605 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-11-10 13:25:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-10 13:25:03,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2018-11-10 13:25:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 13:25:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2018-11-10 13:25:03,925 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 18 [2018-11-10 13:25:03,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:03,925 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2018-11-10 13:25:03,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:25:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2018-11-10 13:25:03,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 13:25:03,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:03,926 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:03,927 INFO L424 AbstractCegarLoop]: === Iteration 5 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:25:03,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:03,927 INFO L82 PathProgramCache]: Analyzing trace with hash 346833314, now seen corresponding path program 1 times [2018-11-10 13:25:03,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:25:03,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:03,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:03,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:03,928 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:25:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:03,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:03,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:25:03,957 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:25:03,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:25:03,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:25:03,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:25:03,957 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 5 states. [2018-11-10 13:25:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:04,034 INFO L93 Difference]: Finished difference Result 105 states and 134 transitions. [2018-11-10 13:25:04,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:25:04,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-10 13:25:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:04,035 INFO L225 Difference]: With dead ends: 105 [2018-11-10 13:25:04,035 INFO L226 Difference]: Without dead ends: 104 [2018-11-10 13:25:04,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:25:04,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-10 13:25:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-11-10 13:25:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 13:25:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2018-11-10 13:25:04,047 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 19 [2018-11-10 13:25:04,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:04,047 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2018-11-10 13:25:04,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:25:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2018-11-10 13:25:04,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 13:25:04,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:04,048 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:04,049 INFO L424 AbstractCegarLoop]: === Iteration 6 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:25:04,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:04,049 INFO L82 PathProgramCache]: Analyzing trace with hash 706273254, now seen corresponding path program 1 times [2018-11-10 13:25:04,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:25:04,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:04,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:04,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:04,052 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:25:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 13:25:04,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:04,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:25:04,080 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:25:04,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:25:04,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:25:04,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:25:04,081 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 5 states. [2018-11-10 13:25:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:04,119 INFO L93 Difference]: Finished difference Result 136 states and 172 transitions. [2018-11-10 13:25:04,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:25:04,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-10 13:25:04,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:04,120 INFO L225 Difference]: With dead ends: 136 [2018-11-10 13:25:04,120 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 13:25:04,121 INFO L605 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-11-10 13:25:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 13:25:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-11-10 13:25:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 13:25:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-11-10 13:25:04,127 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 22 [2018-11-10 13:25:04,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:04,127 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-11-10 13:25:04,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:25:04,127 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-11-10 13:25:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 13:25:04,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:04,128 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:04,128 INFO L424 AbstractCegarLoop]: === Iteration 7 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:25:04,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:04,129 INFO L82 PathProgramCache]: Analyzing trace with hash -877263665, now seen corresponding path program 1 times [2018-11-10 13:25:04,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:25:04,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:04,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:04,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:04,130 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:25:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:04,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:04,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:25:04,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:25:04,171 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-10 13:25:04,173 INFO L202 CegarAbsIntRunner]: [0], [1], [11], [14], [15], [17], [19], [21], [22], [26], [30], [34], [38], [53], [54], [55], [56], [57], [59] [2018-11-10 13:25:04,204 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:25:04,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:25:04,323 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:25:04,324 INFO L272 AbstractInterpreter]: Visited 19 different actions 49 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-10 13:25:04,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:04,329 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:25:04,390 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 53.64% of their original sizes. [2018-11-10 13:25:04,390 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:25:04,503 INFO L415 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-11-10 13:25:04,503 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:25:04,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:25:04,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 16 [2018-11-10 13:25:04,504 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:25:04,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 13:25:04,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 13:25:04,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:25:04,505 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 12 states. [2018-11-10 13:25:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:05,211 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2018-11-10 13:25:05,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 13:25:05,211 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-10 13:25:05,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:05,212 INFO L225 Difference]: With dead ends: 76 [2018-11-10 13:25:05,212 INFO L226 Difference]: Without dead ends: 71 [2018-11-10 13:25:05,212 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-11-10 13:25:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-10 13:25:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-11-10 13:25:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 13:25:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-11-10 13:25:05,220 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 21 [2018-11-10 13:25:05,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:05,220 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-11-10 13:25:05,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 13:25:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-11-10 13:25:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 13:25:05,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:05,221 INFO L375 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-11-10 13:25:05,222 INFO L424 AbstractCegarLoop]: === Iteration 8 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:25:05,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:05,222 INFO L82 PathProgramCache]: Analyzing trace with hash 636804180, now seen corresponding path program 1 times [2018-11-10 13:25:05,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:25:05,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:05,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:05,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:05,223 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:25:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 13:25:05,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:25:05,296 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:25:05,296 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-10 13:25:05,296 INFO L202 CegarAbsIntRunner]: [0], [1], [11], [14], [15], [17], [19], [21], [22], [23], [25], [26], [30], [34], [38], [53], [54], [55], [56], [57], [59] [2018-11-10 13:25:05,297 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:25:05,298 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:25:05,336 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:25:05,337 INFO L272 AbstractInterpreter]: Visited 21 different actions 76 times. Merged at 5 different actions 21 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-10 13:25:05,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:05,340 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:25:05,377 INFO L227 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 54.29% of their original sizes. [2018-11-10 13:25:05,377 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:25:05,510 INFO L415 sIntCurrentIteration]: We unified 31 AI predicates to 31 [2018-11-10 13:25:05,510 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:25:05,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:25:05,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [9] total 24 [2018-11-10 13:25:05,511 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:25:05,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 13:25:05,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 13:25:05,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-11-10 13:25:05,511 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 17 states. [2018-11-10 13:25:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:06,293 INFO L93 Difference]: Finished difference Result 135 states and 159 transitions. [2018-11-10 13:25:06,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 13:25:06,293 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-11-10 13:25:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:06,294 INFO L225 Difference]: With dead ends: 135 [2018-11-10 13:25:06,294 INFO L226 Difference]: Without dead ends: 123 [2018-11-10 13:25:06,294 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 13:25:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-10 13:25:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 110. [2018-11-10 13:25:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-10 13:25:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2018-11-10 13:25:06,306 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 32 [2018-11-10 13:25:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:06,307 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2018-11-10 13:25:06,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 13:25:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2018-11-10 13:25:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 13:25:06,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:06,308 INFO L375 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-11-10 13:25:06,308 INFO L424 AbstractCegarLoop]: === Iteration 9 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:25:06,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:06,309 INFO L82 PathProgramCache]: Analyzing trace with hash 563823123, now seen corresponding path program 2 times [2018-11-10 13:25:06,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:25:06,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:06,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:06,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:06,310 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:25:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 13:25:06,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:25:06,380 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:25:06,380 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:25:06,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:25:06,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:25:06,381 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/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-11-10 13:25:06,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:25:06,389 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:25:06,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 13:25:06,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:25:06,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:25:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 13:25:06,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:25:23,290 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-10 13:25:25,314 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_3| Int) (|v_mult_#in~n_BEFORE_CALL_4| Int) (v_mult_~n_BEFORE_CALL_5 Int) (v_mult_~n_BEFORE_CALL_4 Int) (v_mult_~n_BEFORE_CALL_6 Int)) (or (< (+ v_mult_~n_BEFORE_CALL_5 v_mult_~n_BEFORE_CALL_4 v_mult_~n_BEFORE_CALL_6 |c_mult_#res|) 2147483648) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_4| v_prenex_3) (<= 2147483648 (+ v_prenex_4 v_prenex_3 v_mult_~n_BEFORE_CALL_6)) (forall ((v_prenex_5 Int)) (or (< v_prenex_5 v_prenex_2) (<= 2147483648 (* 3 v_prenex_5)) (< (+ v_prenex_5 (* 2 v_prenex_3)) 2147483648))) (< (* 3 v_prenex_4) 2147483648) (<= v_prenex_2 v_prenex_4))) (<= 2147483648 (* 3 v_mult_~n_BEFORE_CALL_4)) (< v_mult_~n_BEFORE_CALL_4 |v_mult_#in~n_BEFORE_CALL_3|) (exists ((v_prenex_1 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_3| v_prenex_1) (< (* 3 v_prenex_1) 2147483648) (<= 2147483648 (+ v_prenex_1 (* 2 v_mult_~n_BEFORE_CALL_5))))) (< v_mult_~n_BEFORE_CALL_5 |v_mult_#in~n_BEFORE_CALL_4|))) is different from false [2018-11-10 13:25:25,334 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-10 13:25:27,364 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_3| Int) (v_mult_~n_BEFORE_CALL_5 Int) (v_mult_~n_BEFORE_CALL_4 Int)) (or (< (+ v_mult_~n_BEFORE_CALL_5 v_mult_~n_BEFORE_CALL_4 |c_mult_#in~n|) 2147483648) (<= 2147483648 (* 3 v_mult_~n_BEFORE_CALL_4)) (< v_mult_~n_BEFORE_CALL_4 |v_mult_#in~n_BEFORE_CALL_3|) (< v_mult_~n_BEFORE_CALL_5 |c_mult_#in~n|) (exists ((v_prenex_1 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_3| v_prenex_1) (< (* 3 v_prenex_1) 2147483648) (<= 2147483648 (+ v_prenex_1 (* 2 v_mult_~n_BEFORE_CALL_5))))))) is different from false [2018-11-10 13:25:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 23 refuted. 10 times theorem prover too weak. 3 trivial. 4 not checked. [2018-11-10 13:25:27,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:25:27,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 26 [2018-11-10 13:25:27,428 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:25:27,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 13:25:27,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 13:25:27,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=543, Unknown=7, NotChecked=48, Total=702 [2018-11-10 13:25:27,430 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand 16 states. [2018-11-10 13:25:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:27,717 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2018-11-10 13:25:27,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 13:25:27,717 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-11-10 13:25:27,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:27,718 INFO L225 Difference]: With dead ends: 142 [2018-11-10 13:25:27,718 INFO L226 Difference]: Without dead ends: 141 [2018-11-10 13:25:27,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=292, Invalid=1187, Unknown=7, NotChecked=74, Total=1560 [2018-11-10 13:25:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-10 13:25:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 120. [2018-11-10 13:25:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-10 13:25:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2018-11-10 13:25:27,727 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 43 [2018-11-10 13:25:27,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:27,727 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2018-11-10 13:25:27,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 13:25:27,727 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2018-11-10 13:25:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 13:25:27,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:27,729 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:27,729 INFO L424 AbstractCegarLoop]: === Iteration 10 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:25:27,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:27,729 INFO L82 PathProgramCache]: Analyzing trace with hash 298647684, now seen corresponding path program 1 times [2018-11-10 13:25:27,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:25:27,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:27,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:25:27,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:27,730 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:25:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:27,763 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:25:27,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:25:27,763 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:25:27,763 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-10 13:25:27,763 INFO L202 CegarAbsIntRunner]: [0], [1], [11], [14], [15], [17], [19], [21], [23], [24], [25], [26], [30], [34], [38], [53], [54], [55], [56], [57], [59] [2018-11-10 13:25:27,764 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:25:27,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:25:27,793 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:25:27,793 INFO L272 AbstractInterpreter]: Visited 21 different actions 76 times. Merged at 5 different actions 21 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-10 13:25:27,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:27,794 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:25:27,829 INFO L227 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 54.69% of their original sizes. [2018-11-10 13:25:27,829 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:25:28,034 INFO L415 sIntCurrentIteration]: We unified 43 AI predicates to 43 [2018-11-10 13:25:28,034 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:25:28,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:25:28,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 25 [2018-11-10 13:25:28,034 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:25:28,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-10 13:25:28,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 13:25:28,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-11-10 13:25:28,035 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand 22 states. [2018-11-10 13:25:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:29,703 INFO L93 Difference]: Finished difference Result 207 states and 236 transitions. [2018-11-10 13:25:29,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-10 13:25:29,703 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2018-11-10 13:25:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:29,704 INFO L225 Difference]: With dead ends: 207 [2018-11-10 13:25:29,704 INFO L226 Difference]: Without dead ends: 190 [2018-11-10 13:25:29,704 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=611, Invalid=2251, Unknown=0, NotChecked=0, Total=2862 [2018-11-10 13:25:29,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-10 13:25:29,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2018-11-10 13:25:29,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-10 13:25:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 188 transitions. [2018-11-10 13:25:29,714 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 188 transitions. Word has length 44 [2018-11-10 13:25:29,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:29,714 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 188 transitions. [2018-11-10 13:25:29,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-10 13:25:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 188 transitions. [2018-11-10 13:25:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 13:25:29,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:29,716 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:29,716 INFO L424 AbstractCegarLoop]: === Iteration 11 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:25:29,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:29,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1584706800, now seen corresponding path program 3 times [2018-11-10 13:25:29,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:25:29,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:29,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:29,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:29,718 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:25:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:25:29,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:25:29,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:25:29,831 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:25:29,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:25:29,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:25:29,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/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-11-10 13:25:29,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:25:29,837 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:25:29,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:25:29,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:25:29,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:25:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:25:29,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:25:44,655 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-10 13:25:49,814 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-10 13:25:51,828 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_mult_#t~ret1_AFTER_RETURN_5| Int) (v_mult_~n_BEFORE_CALL_12 Int) (v_mult_~n_BEFORE_CALL_13 Int) (|v_mult_#in~n_BEFORE_CALL_8| Int) (|v_mult_#in~n_BEFORE_CALL_9| Int)) (or (< v_mult_~n_BEFORE_CALL_13 |c_mult_#in~n|) (< (+ v_mult_~n_BEFORE_CALL_13 |c_mult_#res|) |v_mult_#t~ret1_AFTER_RETURN_5|) (< v_mult_~n_BEFORE_CALL_12 |v_mult_#in~n_BEFORE_CALL_9|) (exists ((v_mult_~n_BEFORE_CALL_11 Int)) (and (<= 2147483648 (+ (* 3 v_mult_~n_BEFORE_CALL_12) v_mult_~n_BEFORE_CALL_11)) (<= |v_mult_#in~n_BEFORE_CALL_8| v_mult_~n_BEFORE_CALL_11) (< (* 4 v_mult_~n_BEFORE_CALL_11) 2147483648))) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_9| v_prenex_9) (< (* 4 v_prenex_7) 2147483648) (<= v_prenex_10 v_prenex_7) (forall ((v_prenex_11 Int)) (or (<= 2147483648 (* 4 v_prenex_11)) (< v_prenex_11 v_prenex_10) (< (+ v_prenex_11 (* 3 v_prenex_9)) 2147483648))) (<= 2147483648 (+ v_prenex_7 (* 2 v_mult_~n_BEFORE_CALL_13) v_prenex_9)))) (forall ((v_prenex_6 Int)) (or (<= 2147483648 (* 4 v_prenex_6)) (< v_prenex_6 |v_mult_#in~n_BEFORE_CALL_8|) (< (+ v_prenex_6 |v_mult_#t~ret1_AFTER_RETURN_5| v_mult_~n_BEFORE_CALL_12) 2147483648))))) is different from false [2018-11-10 13:25:51,843 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-10 13:25:51,854 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-10 13:25:53,864 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_mult_#t~ret1_AFTER_RETURN_5| Int) (v_mult_~n_BEFORE_CALL_12 Int) (v_mult_~n_BEFORE_CALL_13 Int) (|v_mult_#in~n_BEFORE_CALL_8| Int) (|v_mult_#in~n_BEFORE_CALL_9| Int)) (or (< v_mult_~n_BEFORE_CALL_13 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_12 |v_mult_#in~n_BEFORE_CALL_9|) (exists ((v_mult_~n_BEFORE_CALL_11 Int)) (and (<= 2147483648 (+ (* 3 v_mult_~n_BEFORE_CALL_12) v_mult_~n_BEFORE_CALL_11)) (<= |v_mult_#in~n_BEFORE_CALL_8| v_mult_~n_BEFORE_CALL_11) (< (* 4 v_mult_~n_BEFORE_CALL_11) 2147483648))) (< (+ v_mult_~n_BEFORE_CALL_13 c_mult_~n |c_mult_#t~ret1|) |v_mult_#t~ret1_AFTER_RETURN_5|) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_9| v_prenex_9) (< (* 4 v_prenex_7) 2147483648) (<= v_prenex_10 v_prenex_7) (forall ((v_prenex_11 Int)) (or (<= 2147483648 (* 4 v_prenex_11)) (< v_prenex_11 v_prenex_10) (< (+ v_prenex_11 (* 3 v_prenex_9)) 2147483648))) (<= 2147483648 (+ v_prenex_7 (* 2 v_mult_~n_BEFORE_CALL_13) v_prenex_9)))) (forall ((v_prenex_6 Int)) (or (<= 2147483648 (* 4 v_prenex_6)) (< v_prenex_6 |v_mult_#in~n_BEFORE_CALL_8|) (< (+ v_prenex_6 |v_mult_#t~ret1_AFTER_RETURN_5| v_mult_~n_BEFORE_CALL_12) 2147483648))))) is different from false [2018-11-10 13:25:54,106 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-10 13:25:54,112 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-10 13:25:54,141 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-10 13:25:56,148 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_mult_#t~ret1_AFTER_RETURN_5| Int) (v_mult_~n_BEFORE_CALL_12 Int) (v_mult_~n_BEFORE_CALL_13 Int) (|v_mult_#in~n_BEFORE_CALL_8| Int) (|v_mult_#in~n_BEFORE_CALL_9| Int)) (or (< v_mult_~n_BEFORE_CALL_13 |c_mult_#in~n|) (< (+ v_mult_~n_BEFORE_CALL_13 c_mult_~n) |v_mult_#t~ret1_AFTER_RETURN_5|) (< v_mult_~n_BEFORE_CALL_12 |v_mult_#in~n_BEFORE_CALL_9|) (exists ((v_mult_~n_BEFORE_CALL_11 Int)) (and (<= 2147483648 (+ (* 3 v_mult_~n_BEFORE_CALL_12) v_mult_~n_BEFORE_CALL_11)) (<= |v_mult_#in~n_BEFORE_CALL_8| v_mult_~n_BEFORE_CALL_11) (< (* 4 v_mult_~n_BEFORE_CALL_11) 2147483648))) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_9| v_prenex_9) (< (* 4 v_prenex_7) 2147483648) (<= v_prenex_10 v_prenex_7) (forall ((v_prenex_11 Int)) (or (<= 2147483648 (* 4 v_prenex_11)) (< v_prenex_11 v_prenex_10) (< (+ v_prenex_11 (* 3 v_prenex_9)) 2147483648))) (<= 2147483648 (+ v_prenex_7 (* 2 v_mult_~n_BEFORE_CALL_13) v_prenex_9)))) (forall ((v_prenex_6 Int)) (or (<= 2147483648 (* 4 v_prenex_6)) (< v_prenex_6 |v_mult_#in~n_BEFORE_CALL_8|) (< (+ v_prenex_6 |v_mult_#t~ret1_AFTER_RETURN_5| v_mult_~n_BEFORE_CALL_12) 2147483648))))) is different from false [2018-11-10 13:25:56,196 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 19 [2018-11-10 13:25:56,261 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 8034 disjunctions. This might take some time... [2018-11-10 13:25:56,516 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 90 disjunctions. [2018-11-10 13:25:56,533 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 90 [2018-11-10 13:25:57,101 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 10304 conjuctions. This might take some time... [2018-11-10 13:25:57,124 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 8 conjuctions. [2018-11-10 13:25:59,148 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_mult_#t~ret1_AFTER_RETURN_5| Int) (v_mult_~n_BEFORE_CALL_12 Int) (v_mult_~n_BEFORE_CALL_14 Int) (v_mult_~n_BEFORE_CALL_13 Int) (|v_mult_#in~n_BEFORE_CALL_10| Int) (|v_mult_#in~n_BEFORE_CALL_8| Int) (|v_mult_#in~n_BEFORE_CALL_9| Int)) (or (< v_mult_~n_BEFORE_CALL_13 |v_mult_#in~n_BEFORE_CALL_10|) (< (+ v_mult_~n_BEFORE_CALL_14 v_mult_~n_BEFORE_CALL_13 |c_mult_#res|) |v_mult_#t~ret1_AFTER_RETURN_5|) (< v_mult_~n_BEFORE_CALL_12 |v_mult_#in~n_BEFORE_CALL_9|) (exists ((v_mult_~n_BEFORE_CALL_11 Int)) (and (<= 2147483648 (+ (* 3 v_mult_~n_BEFORE_CALL_12) v_mult_~n_BEFORE_CALL_11)) (<= |v_mult_#in~n_BEFORE_CALL_8| v_mult_~n_BEFORE_CALL_11) (< (* 4 v_mult_~n_BEFORE_CALL_11) 2147483648))) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_9| v_prenex_9) (< (* 4 v_prenex_7) 2147483648) (<= v_prenex_10 v_prenex_7) (forall ((v_prenex_11 Int)) (or (<= 2147483648 (* 4 v_prenex_11)) (< v_prenex_11 v_prenex_10) (< (+ v_prenex_11 (* 3 v_prenex_9)) 2147483648))) (<= 2147483648 (+ v_prenex_7 (* 2 v_mult_~n_BEFORE_CALL_13) v_prenex_9)))) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_10| v_prenex_16) (forall ((v_prenex_20 Int)) (or (< v_prenex_20 v_prenex_12) (<= 2147483648 (* 4 v_prenex_20)) (< (+ (* 3 v_prenex_15) v_prenex_20) 2147483648))) (<= v_prenex_14 (+ v_prenex_16 v_mult_~n_BEFORE_CALL_14)) (<= v_prenex_13 v_prenex_15) (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_19 Int)) (or (< (+ (* 2 v_prenex_16) v_prenex_18 v_prenex_19) 2147483648) (< v_prenex_18 v_prenex_13) (exists ((v_prenex_21 Int)) (and (< (* 4 v_prenex_21) 2147483648) (<= v_prenex_17 v_prenex_21) (<= 2147483648 (+ (* 3 v_prenex_18) v_prenex_21)))) (< v_prenex_19 v_prenex_17) (<= 2147483648 (* 4 v_prenex_19)))) (exists ((v_prenex_22 Int)) (and (<= 2147483648 (+ v_prenex_15 v_prenex_22 v_prenex_14)) (<= v_prenex_12 v_prenex_22) (< (* 4 v_prenex_22) 2147483648))))) (forall ((v_prenex_6 Int)) (or (<= 2147483648 (* 4 v_prenex_6)) (< v_prenex_6 |v_mult_#in~n_BEFORE_CALL_8|) (< (+ v_prenex_6 |v_mult_#t~ret1_AFTER_RETURN_5| v_mult_~n_BEFORE_CALL_12) 2147483648))))) is different from false [2018-11-10 13:26:01,153 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_mult_#t~ret1_AFTER_RETURN_5| Int) (v_mult_~n_BEFORE_CALL_12 Int) (v_mult_~n_BEFORE_CALL_14 Int) (v_mult_~n_BEFORE_CALL_13 Int) (|v_mult_#in~n_BEFORE_CALL_10| Int) (|v_mult_#in~n_BEFORE_CALL_8| Int) (|v_mult_#in~n_BEFORE_CALL_9| Int)) (or (< v_mult_~n_BEFORE_CALL_13 |v_mult_#in~n_BEFORE_CALL_10|) (< (+ v_mult_~n_BEFORE_CALL_14 v_mult_~n_BEFORE_CALL_13 |c_mult_#res|) |v_mult_#t~ret1_AFTER_RETURN_5|) (< v_mult_~n_BEFORE_CALL_12 |v_mult_#in~n_BEFORE_CALL_9|) (exists ((v_mult_~n_BEFORE_CALL_11 Int)) (and (<= 2147483648 (+ (* 3 v_mult_~n_BEFORE_CALL_12) v_mult_~n_BEFORE_CALL_11)) (<= |v_mult_#in~n_BEFORE_CALL_8| v_mult_~n_BEFORE_CALL_11) (< (* 4 v_mult_~n_BEFORE_CALL_11) 2147483648))) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_9| v_prenex_9) (< (* 4 v_prenex_7) 2147483648) (<= v_prenex_10 v_prenex_7) (forall ((v_prenex_11 Int)) (or (<= 2147483648 (* 4 v_prenex_11)) (< v_prenex_11 v_prenex_10) (< (+ v_prenex_11 (* 3 v_prenex_9)) 2147483648))) (<= 2147483648 (+ v_prenex_7 (* 2 v_mult_~n_BEFORE_CALL_13) v_prenex_9)))) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_10| v_prenex_16) (forall ((v_prenex_20 Int)) (or (< v_prenex_20 v_prenex_12) (<= 2147483648 (* 4 v_prenex_20)) (< (+ (* 3 v_prenex_15) v_prenex_20) 2147483648))) (<= v_prenex_14 (+ v_prenex_16 v_mult_~n_BEFORE_CALL_14)) (<= v_prenex_13 v_prenex_15) (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_19 Int)) (or (< (+ (* 2 v_prenex_16) v_prenex_18 v_prenex_19) 2147483648) (< v_prenex_18 v_prenex_13) (exists ((v_prenex_21 Int)) (and (< (* 4 v_prenex_21) 2147483648) (<= v_prenex_17 v_prenex_21) (<= 2147483648 (+ (* 3 v_prenex_18) v_prenex_21)))) (< v_prenex_19 v_prenex_17) (<= 2147483648 (* 4 v_prenex_19)))) (exists ((v_prenex_22 Int)) (and (<= 2147483648 (+ v_prenex_15 v_prenex_22 v_prenex_14)) (<= v_prenex_12 v_prenex_22) (< (* 4 v_prenex_22) 2147483648))))) (forall ((v_prenex_6 Int)) (or (<= 2147483648 (* 4 v_prenex_6)) (< v_prenex_6 |v_mult_#in~n_BEFORE_CALL_8|) (< (+ v_prenex_6 |v_mult_#t~ret1_AFTER_RETURN_5| v_mult_~n_BEFORE_CALL_12) 2147483648))))) is different from true [2018-11-10 13:26:01,158 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-10 13:26:01,181 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2018-11-10 13:26:03,201 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-10 13:26:03,224 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2018-11-10 13:26:07,243 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_mult_#t~ret1_AFTER_RETURN_5| Int) (v_mult_~n_BEFORE_CALL_12 Int) (v_mult_~n_BEFORE_CALL_14 Int) (v_mult_~n_BEFORE_CALL_13 Int) (|v_mult_#in~n_BEFORE_CALL_10| Int) (|v_mult_#in~n_BEFORE_CALL_8| Int) (|v_mult_#in~n_BEFORE_CALL_9| Int)) (or (< v_mult_~n_BEFORE_CALL_13 |v_mult_#in~n_BEFORE_CALL_10|) (< v_mult_~n_BEFORE_CALL_12 |v_mult_#in~n_BEFORE_CALL_9|) (exists ((v_mult_~n_BEFORE_CALL_11 Int)) (and (<= 2147483648 (+ (* 3 v_mult_~n_BEFORE_CALL_12) v_mult_~n_BEFORE_CALL_11)) (<= |v_mult_#in~n_BEFORE_CALL_8| v_mult_~n_BEFORE_CALL_11) (< (* 4 v_mult_~n_BEFORE_CALL_11) 2147483648))) (< (+ v_mult_~n_BEFORE_CALL_14 v_mult_~n_BEFORE_CALL_13) |v_mult_#t~ret1_AFTER_RETURN_5|) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_9| v_prenex_9) (< (* 4 v_prenex_7) 2147483648) (<= v_prenex_10 v_prenex_7) (forall ((v_prenex_11 Int)) (or (<= 2147483648 (* 4 v_prenex_11)) (< v_prenex_11 v_prenex_10) (< (+ v_prenex_11 (* 3 v_prenex_9)) 2147483648))) (<= 2147483648 (+ v_prenex_7 (* 2 v_mult_~n_BEFORE_CALL_13) v_prenex_9)))) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_10| v_prenex_16) (forall ((v_prenex_20 Int)) (or (< v_prenex_20 v_prenex_12) (<= 2147483648 (* 4 v_prenex_20)) (< (+ (* 3 v_prenex_15) v_prenex_20) 2147483648))) (<= v_prenex_14 (+ v_prenex_16 v_mult_~n_BEFORE_CALL_14)) (<= v_prenex_13 v_prenex_15) (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_19 Int)) (or (< (+ (* 2 v_prenex_16) v_prenex_18 v_prenex_19) 2147483648) (< v_prenex_18 v_prenex_13) (exists ((v_prenex_21 Int)) (and (< (* 4 v_prenex_21) 2147483648) (<= v_prenex_17 v_prenex_21) (<= 2147483648 (+ (* 3 v_prenex_18) v_prenex_21)))) (< v_prenex_19 v_prenex_17) (<= 2147483648 (* 4 v_prenex_19)))) (exists ((v_prenex_22 Int)) (and (<= 2147483648 (+ v_prenex_15 v_prenex_22 v_prenex_14)) (<= v_prenex_12 v_prenex_22) (< (* 4 v_prenex_22) 2147483648))))) (forall ((v_prenex_6 Int)) (or (<= 2147483648 (* 4 v_prenex_6)) (< v_prenex_6 |v_mult_#in~n_BEFORE_CALL_8|) (< (+ v_prenex_6 |v_mult_#t~ret1_AFTER_RETURN_5| v_mult_~n_BEFORE_CALL_12) 2147483648))))) is different from false [2018-11-10 13:26:09,246 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_mult_#t~ret1_AFTER_RETURN_5| Int) (v_mult_~n_BEFORE_CALL_12 Int) (v_mult_~n_BEFORE_CALL_14 Int) (v_mult_~n_BEFORE_CALL_13 Int) (|v_mult_#in~n_BEFORE_CALL_10| Int) (|v_mult_#in~n_BEFORE_CALL_8| Int) (|v_mult_#in~n_BEFORE_CALL_9| Int)) (or (< v_mult_~n_BEFORE_CALL_13 |v_mult_#in~n_BEFORE_CALL_10|) (< v_mult_~n_BEFORE_CALL_12 |v_mult_#in~n_BEFORE_CALL_9|) (exists ((v_mult_~n_BEFORE_CALL_11 Int)) (and (<= 2147483648 (+ (* 3 v_mult_~n_BEFORE_CALL_12) v_mult_~n_BEFORE_CALL_11)) (<= |v_mult_#in~n_BEFORE_CALL_8| v_mult_~n_BEFORE_CALL_11) (< (* 4 v_mult_~n_BEFORE_CALL_11) 2147483648))) (< (+ v_mult_~n_BEFORE_CALL_14 v_mult_~n_BEFORE_CALL_13) |v_mult_#t~ret1_AFTER_RETURN_5|) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_9| v_prenex_9) (< (* 4 v_prenex_7) 2147483648) (<= v_prenex_10 v_prenex_7) (forall ((v_prenex_11 Int)) (or (<= 2147483648 (* 4 v_prenex_11)) (< v_prenex_11 v_prenex_10) (< (+ v_prenex_11 (* 3 v_prenex_9)) 2147483648))) (<= 2147483648 (+ v_prenex_7 (* 2 v_mult_~n_BEFORE_CALL_13) v_prenex_9)))) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_10| v_prenex_16) (forall ((v_prenex_20 Int)) (or (< v_prenex_20 v_prenex_12) (<= 2147483648 (* 4 v_prenex_20)) (< (+ (* 3 v_prenex_15) v_prenex_20) 2147483648))) (<= v_prenex_14 (+ v_prenex_16 v_mult_~n_BEFORE_CALL_14)) (<= v_prenex_13 v_prenex_15) (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_19 Int)) (or (< (+ (* 2 v_prenex_16) v_prenex_18 v_prenex_19) 2147483648) (< v_prenex_18 v_prenex_13) (exists ((v_prenex_21 Int)) (and (< (* 4 v_prenex_21) 2147483648) (<= v_prenex_17 v_prenex_21) (<= 2147483648 (+ (* 3 v_prenex_18) v_prenex_21)))) (< v_prenex_19 v_prenex_17) (<= 2147483648 (* 4 v_prenex_19)))) (exists ((v_prenex_22 Int)) (and (<= 2147483648 (+ v_prenex_15 v_prenex_22 v_prenex_14)) (<= v_prenex_12 v_prenex_22) (< (* 4 v_prenex_22) 2147483648))))) (forall ((v_prenex_6 Int)) (or (<= 2147483648 (* 4 v_prenex_6)) (< v_prenex_6 |v_mult_#in~n_BEFORE_CALL_8|) (< (+ v_prenex_6 |v_mult_#t~ret1_AFTER_RETURN_5| v_mult_~n_BEFORE_CALL_12) 2147483648))))) is different from true [2018-11-10 13:26:11,256 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-10 13:26:11,277 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2018-11-10 13:26:15,299 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-10 13:26:15,320 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2018-11-10 13:26:17,338 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-10 13:26:17,342 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-10 13:26:17,346 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-10 13:26:17,351 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-10 13:26:17,359 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-10 13:26:19,366 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_mult_#t~ret1_AFTER_RETURN_5| Int) (v_mult_~n_BEFORE_CALL_12 Int) (v_mult_~n_BEFORE_CALL_13 Int) (|v_mult_#in~n_BEFORE_CALL_8| Int) (|v_mult_#in~n_BEFORE_CALL_9| Int)) (or (< v_mult_~n_BEFORE_CALL_13 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_12 |v_mult_#in~n_BEFORE_CALL_9|) (exists ((v_mult_~n_BEFORE_CALL_11 Int)) (and (<= 2147483648 (+ (* 3 v_mult_~n_BEFORE_CALL_12) v_mult_~n_BEFORE_CALL_11)) (<= |v_mult_#in~n_BEFORE_CALL_8| v_mult_~n_BEFORE_CALL_11) (< (* 4 v_mult_~n_BEFORE_CALL_11) 2147483648))) (< (+ v_mult_~n_BEFORE_CALL_13 |c_mult_#in~n|) |v_mult_#t~ret1_AFTER_RETURN_5|) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_9| v_prenex_9) (< (* 4 v_prenex_7) 2147483648) (<= v_prenex_10 v_prenex_7) (forall ((v_prenex_11 Int)) (or (<= 2147483648 (* 4 v_prenex_11)) (< v_prenex_11 v_prenex_10) (< (+ v_prenex_11 (* 3 v_prenex_9)) 2147483648))) (<= 2147483648 (+ v_prenex_7 (* 2 v_mult_~n_BEFORE_CALL_13) v_prenex_9)))) (forall ((v_prenex_6 Int)) (or (<= 2147483648 (* 4 v_prenex_6)) (< v_prenex_6 |v_mult_#in~n_BEFORE_CALL_8|) (< (+ v_prenex_6 |v_mult_#t~ret1_AFTER_RETURN_5| v_mult_~n_BEFORE_CALL_12) 2147483648))))) is different from false [2018-11-10 13:26:21,370 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_mult_#t~ret1_AFTER_RETURN_5| Int) (v_mult_~n_BEFORE_CALL_12 Int) (v_mult_~n_BEFORE_CALL_13 Int) (|v_mult_#in~n_BEFORE_CALL_8| Int) (|v_mult_#in~n_BEFORE_CALL_9| Int)) (or (< v_mult_~n_BEFORE_CALL_13 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_12 |v_mult_#in~n_BEFORE_CALL_9|) (exists ((v_mult_~n_BEFORE_CALL_11 Int)) (and (<= 2147483648 (+ (* 3 v_mult_~n_BEFORE_CALL_12) v_mult_~n_BEFORE_CALL_11)) (<= |v_mult_#in~n_BEFORE_CALL_8| v_mult_~n_BEFORE_CALL_11) (< (* 4 v_mult_~n_BEFORE_CALL_11) 2147483648))) (< (+ v_mult_~n_BEFORE_CALL_13 |c_mult_#in~n|) |v_mult_#t~ret1_AFTER_RETURN_5|) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_9| v_prenex_9) (< (* 4 v_prenex_7) 2147483648) (<= v_prenex_10 v_prenex_7) (forall ((v_prenex_11 Int)) (or (<= 2147483648 (* 4 v_prenex_11)) (< v_prenex_11 v_prenex_10) (< (+ v_prenex_11 (* 3 v_prenex_9)) 2147483648))) (<= 2147483648 (+ v_prenex_7 (* 2 v_mult_~n_BEFORE_CALL_13) v_prenex_9)))) (forall ((v_prenex_6 Int)) (or (<= 2147483648 (* 4 v_prenex_6)) (< v_prenex_6 |v_mult_#in~n_BEFORE_CALL_8|) (< (+ v_prenex_6 |v_mult_#t~ret1_AFTER_RETURN_5| v_mult_~n_BEFORE_CALL_12) 2147483648))))) is different from true [2018-11-10 13:26:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 21 refuted. 5 times theorem prover too weak. 1 trivial. 44 not checked. [2018-11-10 13:26:21,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:26:21,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 17] total 34 [2018-11-10 13:26:21,478 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:26:21,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 13:26:21,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 13:26:21,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=690, Unknown=13, NotChecked=354, Total=1190 [2018-11-10 13:26:21,479 INFO L87 Difference]: Start difference. First operand 163 states and 188 transitions. Second operand 19 states. [2018-11-10 13:26:21,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:26:21,977 INFO L93 Difference]: Finished difference Result 214 states and 245 transitions. [2018-11-10 13:26:21,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 13:26:21,977 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-11-10 13:26:21,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:26:21,978 INFO L225 Difference]: With dead ends: 214 [2018-11-10 13:26:21,979 INFO L226 Difference]: Without dead ends: 213 [2018-11-10 13:26:21,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 38.4s TimeCoverageRelationStatistics Valid=367, Invalid=1624, Unknown=13, NotChecked=546, Total=2550 [2018-11-10 13:26:21,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-10 13:26:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 177. [2018-11-10 13:26:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-10 13:26:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 203 transitions. [2018-11-10 13:26:21,989 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 203 transitions. Word has length 54 [2018-11-10 13:26:21,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:26:21,989 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 203 transitions. [2018-11-10 13:26:21,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 13:26:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2018-11-10 13:26:21,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 13:26:21,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:26:21,990 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:26:21,991 INFO L424 AbstractCegarLoop]: === Iteration 12 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:26:21,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:26:21,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1881270489, now seen corresponding path program 2 times [2018-11-10 13:26:21,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:26:21,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:26:21,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:26:21,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:26:21,992 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:26:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:26:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 13:26:22,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:26:22,026 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:26:22,027 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:26:22,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:26:22,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:26:22,027 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/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-11-10 13:26:22,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:26:22,032 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:26:22,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 13:26:22,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:26:22,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:26:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 13:26:22,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:26:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 13:26:22,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:26:22,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2018-11-10 13:26:22,094 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:26:22,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:26:22,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:26:22,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:26:22,095 INFO L87 Difference]: Start difference. First operand 177 states and 203 transitions. Second operand 7 states. [2018-11-10 13:26:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:26:22,126 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2018-11-10 13:26:22,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:26:22,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-11-10 13:26:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:26:22,128 INFO L225 Difference]: With dead ends: 179 [2018-11-10 13:26:22,128 INFO L226 Difference]: Without dead ends: 178 [2018-11-10 13:26:22,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 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-11-10 13:26:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-10 13:26:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2018-11-10 13:26:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-10 13:26:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2018-11-10 13:26:22,135 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 186 transitions. Word has length 55 [2018-11-10 13:26:22,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:26:22,135 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 186 transitions. [2018-11-10 13:26:22,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:26:22,135 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 186 transitions. [2018-11-10 13:26:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 13:26:22,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:26:22,136 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:26:22,136 INFO L424 AbstractCegarLoop]: === Iteration 13 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:26:22,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:26:22,137 INFO L82 PathProgramCache]: Analyzing trace with hash -244142493, now seen corresponding path program 1 times [2018-11-10 13:26:22,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:26:22,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:26:22,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:26:22,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:26:22,137 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:26:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:26:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 7 proven. 39 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 13:26:22,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:26:22,187 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:26:22,187 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-10 13:26:22,188 INFO L202 CegarAbsIntRunner]: [0], [1], [11], [14], [15], [17], [19], [21], [22], [23], [25], [26], [30], [34], [38], [40], [53], [54], [55], [56], [57], [59], [60], [61] [2018-11-10 13:26:22,189 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:26:22,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:26:22,276 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:26:22,276 INFO L272 AbstractInterpreter]: Visited 24 different actions 360 times. Merged at 7 different actions 111 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-10 13:26:22,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:26:22,282 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:26:22,316 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 55.98% of their original sizes. [2018-11-10 13:26:22,316 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:26:22,656 INFO L415 sIntCurrentIteration]: We unified 60 AI predicates to 60 [2018-11-10 13:26:22,656 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:26:22,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:26:22,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [7] total 34 [2018-11-10 13:26:22,657 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:26:22,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-10 13:26:22,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-10 13:26:22,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2018-11-10 13:26:22,658 INFO L87 Difference]: Start difference. First operand 164 states and 186 transitions. Second operand 28 states. [2018-11-10 13:26:23,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:26:23,672 INFO L93 Difference]: Finished difference Result 228 states and 260 transitions. [2018-11-10 13:26:23,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-10 13:26:23,672 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-11-10 13:26:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:26:23,672 INFO L225 Difference]: With dead ends: 228 [2018-11-10 13:26:23,673 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 13:26:23,674 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 82 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=462, Invalid=1988, Unknown=0, NotChecked=0, Total=2450 [2018-11-10 13:26:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 13:26:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 13:26:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 13:26:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:26:23,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2018-11-10 13:26:23,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:26:23,674 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:26:23,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-10 13:26:23,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:26:23,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 13:26:23,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 13:26:24,249 WARN L179 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 49 [2018-11-10 13:26:24,262 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 13:26:24,262 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:26:24,262 INFO L428 ceAbstractionStarter]: At program point multENTRY(lines 15 23) the Hoare annotation is: true [2018-11-10 13:26:24,262 INFO L425 ceAbstractionStarter]: For program point multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2018-11-10 13:26:24,262 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 21) no Hoare annotation was computed. [2018-11-10 13:26:24,262 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-10 13:26:24,262 INFO L425 ceAbstractionStarter]: For program point multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 13:26:24,262 INFO L425 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2018-11-10 13:26:24,262 INFO L421 ceAbstractionStarter]: At program point L17-2(line 17) the Hoare annotation is: (or (< 46340 |mult_#in~m|) (< 139020 (* 3 |mult_#in~n|)) (< |mult_#in~n| 0) (< (* 2 |mult_#in~m|) 0)) [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point L17-3(line 17) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point multFINAL(lines 15 23) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L421 ceAbstractionStarter]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse1 (* 2 |mult_#in~m|)) (.cse7 (* 2 |mult_#in~n|))) (let ((.cse5 (< 139020 (* 3 |mult_#in~n|))) (.cse6 (< |mult_#in~n| 0)) (.cse0 (< .cse7 0)) (.cse2 (< 92680 .cse7)) (.cse3 (* 2 mult_~m)) (.cse4 (< .cse1 0))) (and (or .cse0 (< 92678 .cse1) .cse2 (<= .cse3 92678) .cse4) (or (< 46340 |mult_#in~m|) .cse5 (and (<= mult_~m 46340) (= mult_~n |mult_#in~n|) (<= 2 .cse3)) .cse6 .cse4) (or (and (<= |mult_#in~m| mult_~m) (<= mult_~m |mult_#in~m|)) (< 92674 .cse1) .cse5 .cse6 .cse4) (or .cse0 (< 92676 .cse1) .cse2 (<= .cse3 92676) .cse4)))) [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point L22-3(line 22) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point L22-4(line 22) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point L22-5(line 22) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 18) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point multEXIT(lines 15 23) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 13:26:24,263 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point L34-1(line 34) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. [2018-11-10 13:26:24,263 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 25 41) the Hoare annotation is: true [2018-11-10 13:26:24,264 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 29) no Hoare annotation was computed. [2018-11-10 13:26:24,264 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 25 41) no Hoare annotation was computed. [2018-11-10 13:26:24,264 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 13:26:24,264 INFO L425 ceAbstractionStarter]: For program point L36(lines 36 40) no Hoare annotation was computed. [2018-11-10 13:26:24,264 INFO L421 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (and (<= main_~m~0 46340) (<= 0 (* 2 main_~m~0)) (<= main_~n~0 46340) (<= 0 (* 2 main_~n~0))) [2018-11-10 13:26:24,264 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 25 41) no Hoare annotation was computed. [2018-11-10 13:26:24,264 INFO L421 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: (and (<= main_~m~0 46340) (<= 0 (* 2 main_~m~0)) (<= main_~n~0 46340) (<= 0 (* 2 main_~n~0))) [2018-11-10 13:26:24,264 INFO L425 ceAbstractionStarter]: For program point L35-1(line 35) no Hoare annotation was computed. [2018-11-10 13:26:24,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:26:24 BoogieIcfgContainer [2018-11-10 13:26:24,265 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:26:24,266 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:26:24,266 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:26:24,266 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:26:24,266 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:25:03" (3/4) ... [2018-11-10 13:26:24,268 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 13:26:24,272 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 13:26:24,272 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure mult [2018-11-10 13:26:24,272 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 13:26:24,276 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 13:26:24,276 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 13:26:24,276 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 13:26:24,306 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0200f16a-b003-4786-9665-9abb4e6e7df6/bin-2019/utaipan/witness.graphml [2018-11-10 13:26:24,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:26:24,306 INFO L168 Benchmark]: Toolchain (without parser) took 81435.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 263.7 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -193.2 MB). Peak memory consumption was 70.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:26:24,307 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:26:24,307 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.20 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:26:24,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.36 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:26:24,308 INFO L168 Benchmark]: Boogie Preprocessor took 11.76 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 941.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:26:24,308 INFO L168 Benchmark]: RCFGBuilder took 183.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-10 13:26:24,308 INFO L168 Benchmark]: TraceAbstraction took 81040.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -43.5 MB). Peak memory consumption was 424.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:26:24,309 INFO L168 Benchmark]: Witness Printer took 40.21 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:26:24,314 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 977.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.20 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 946.9 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 12.36 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.76 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 941.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 183.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 81040.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -43.5 MB). Peak memory consumption was 424.2 MB. Max. memory is 11.5 GB. * Witness Printer took 40.21 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 6 error locations. SAFE Result, 81.0s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 327 SDtfs, 947 SDslu, 1211 SDs, 0 SdLazy, 1065 SolverSat, 427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 640 GetRequests, 354 SyntacticMatches, 15 SemanticMatches, 271 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 61.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 4 AbstIntIterations, 4 AbstIntStrong, 0.9020562770562773 AbsIntWeakeningRatio, 0.5909090909090909 AbsIntAvgWeakeningVarsNumRemoved, 18.428571428571427 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 161 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 99 PreInvPairs, 100 NumberOfFragments, 184 HoareAnnotationTreeSize, 99 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2679 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 73.1s InterpolantComputationTime, 561 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 694 ConstructedInterpolants, 68 QuantifiedInterpolants, 225053 SizeOfPredicates, 12 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 338/752 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...