./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted/Benghazi_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/Benghazi_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2b89ce5b96ce55081609675201b2a9a116c2941a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:43:58,430 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:43:58,431 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:43:58,437 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:43:58,437 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:43:58,438 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:43:58,439 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:43:58,439 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:43:58,440 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:43:58,441 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:43:58,441 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:43:58,441 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:43:58,442 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:43:58,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:43:58,443 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:43:58,443 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:43:58,443 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:43:58,444 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:43:58,446 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:43:58,446 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:43:58,447 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:43:58,448 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:43:58,449 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:43:58,449 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:43:58,449 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:43:58,450 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:43:58,450 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:43:58,450 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:43:58,451 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:43:58,452 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:43:58,452 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:43:58,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:43:58,453 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:43:58,453 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:43:58,453 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:43:58,454 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:43:58,454 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-10 05:43:58,464 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:43:58,465 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:43:58,465 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:43:58,465 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 05:43:58,466 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:43:58,466 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:43:58,466 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:43:58,466 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:43:58,466 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:43:58,467 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:43:58,467 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:43:58,467 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:43:58,467 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:43:58,467 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:43:58,467 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 05:43:58,467 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:43:58,467 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:43:58,468 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:43:58,468 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:43:58,468 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:43:58,468 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:43:58,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:43:58,468 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:43:58,468 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:43:58,469 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:43:58,469 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:43:58,469 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:43:58,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:43:58,469 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b89ce5b96ce55081609675201b2a9a116c2941a [2018-11-10 05:43:58,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:43:58,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:43:58,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:43:58,506 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:43:58,506 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:43:58,507 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/Benghazi_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 05:43:58,552 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/data/77f8960bb/beb9efb231924185afd993683517fd49/FLAG993123cd9 [2018-11-10 05:43:58,881 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:43:58,881 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/sv-benchmarks/c/termination-crafted/Benghazi_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 05:43:58,886 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/data/77f8960bb/beb9efb231924185afd993683517fd49/FLAG993123cd9 [2018-11-10 05:43:58,896 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/data/77f8960bb/beb9efb231924185afd993683517fd49 [2018-11-10 05:43:58,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:43:58,900 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 05:43:58,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:43:58,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:43:58,904 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:43:58,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:43:58" (1/1) ... [2018-11-10 05:43:58,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32089edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:58, skipping insertion in model container [2018-11-10 05:43:58,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:43:58" (1/1) ... [2018-11-10 05:43:58,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:43:58,930 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:43:59,034 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:43:59,036 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:43:59,045 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:43:59,053 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:43:59,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:59 WrapperNode [2018-11-10 05:43:59,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:43:59,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:43:59,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:43:59,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:43:59,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:59" (1/1) ... [2018-11-10 05:43:59,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:59" (1/1) ... [2018-11-10 05:43:59,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:59" (1/1) ... [2018-11-10 05:43:59,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:59" (1/1) ... [2018-11-10 05:43:59,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:59" (1/1) ... [2018-11-10 05:43:59,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:59" (1/1) ... [2018-11-10 05:43:59,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:59" (1/1) ... [2018-11-10 05:43:59,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:43:59,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:43:59,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:43:59,072 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:43:59,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:43:59,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 05:43:59,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:43:59,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 05:43:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 05:43:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 05:43:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 05:43:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:43:59,245 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:43:59,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:43:59 BoogieIcfgContainer [2018-11-10 05:43:59,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:43:59,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 05:43:59,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 05:43:59,249 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 05:43:59,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:43:58" (1/3) ... [2018-11-10 05:43:59,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3afcda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:43:59, skipping insertion in model container [2018-11-10 05:43:59,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:59" (2/3) ... [2018-11-10 05:43:59,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3afcda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:43:59, skipping insertion in model container [2018-11-10 05:43:59,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:43:59" (3/3) ... [2018-11-10 05:43:59,252 INFO L112 eAbstractionObserver]: Analyzing ICFG Benghazi_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 05:43:59,260 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 05:43:59,266 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-10 05:43:59,275 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-10 05:43:59,293 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:43:59,294 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 05:43:59,294 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 05:43:59,294 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 05:43:59,294 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:43:59,294 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:43:59,294 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 05:43:59,294 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:43:59,295 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 05:43:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-10 05:43:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 05:43:59,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:43:59,310 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:59,311 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:43:59,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:59,315 INFO L82 PathProgramCache]: Analyzing trace with hash -895809593, now seen corresponding path program 1 times [2018-11-10 05:43:59,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:59,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:59,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:59,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:59,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:59,416 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 05:43:59,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:43:59,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:43:59,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:43:59,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:43:59,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:43:59,429 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2018-11-10 05:43:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:43:59,465 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-10 05:43:59,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:43:59,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-10 05:43:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:43:59,473 INFO L225 Difference]: With dead ends: 37 [2018-11-10 05:43:59,473 INFO L226 Difference]: Without dead ends: 23 [2018-11-10 05:43:59,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:43:59,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-10 05:43:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-10 05:43:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 05:43:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-10 05:43:59,497 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 8 [2018-11-10 05:43:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:43:59,498 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-10 05:43:59,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:43:59,498 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-10 05:43:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 05:43:59,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:43:59,498 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:59,499 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:43:59,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:59,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2000293559, now seen corresponding path program 1 times [2018-11-10 05:43:59,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:59,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:59,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:59,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:59,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:59,527 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 05:43:59,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:43:59,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:43:59,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:43:59,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:43:59,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:43:59,529 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 4 states. [2018-11-10 05:43:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:43:59,564 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-10 05:43:59,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:43:59,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-11-10 05:43:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:43:59,565 INFO L225 Difference]: With dead ends: 28 [2018-11-10 05:43:59,565 INFO L226 Difference]: Without dead ends: 27 [2018-11-10 05:43:59,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:43:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-10 05:43:59,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-11-10 05:43:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 05:43:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-10 05:43:59,568 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 9 [2018-11-10 05:43:59,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:43:59,568 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-10 05:43:59,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:43:59,569 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-10 05:43:59,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 05:43:59,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:43:59,569 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:59,569 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:43:59,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:59,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1879558135, now seen corresponding path program 1 times [2018-11-10 05:43:59,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:59,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:59,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:59,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:59,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:59,586 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 05:43:59,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:43:59,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:43:59,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:43:59,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:43:59,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:43:59,587 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 3 states. [2018-11-10 05:43:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:43:59,616 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-10 05:43:59,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:43:59,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-10 05:43:59,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:43:59,617 INFO L225 Difference]: With dead ends: 30 [2018-11-10 05:43:59,617 INFO L226 Difference]: Without dead ends: 29 [2018-11-10 05:43:59,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:43:59,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-10 05:43:59,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-10 05:43:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 05:43:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-10 05:43:59,620 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 10 [2018-11-10 05:43:59,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:43:59,621 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-10 05:43:59,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:43:59,621 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-10 05:43:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 05:43:59,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:43:59,621 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:59,621 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:43:59,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:59,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1863240011, now seen corresponding path program 1 times [2018-11-10 05:43:59,622 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:59,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:59,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:59,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:59,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:59,637 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 05:43:59,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:43:59,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:43:59,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:43:59,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:43:59,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:43:59,638 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 3 states. [2018-11-10 05:43:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:43:59,654 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-10 05:43:59,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:43:59,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 05:43:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:43:59,655 INFO L225 Difference]: With dead ends: 30 [2018-11-10 05:43:59,655 INFO L226 Difference]: Without dead ends: 29 [2018-11-10 05:43:59,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:43:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-10 05:43:59,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-11-10 05:43:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 05:43:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-10 05:43:59,659 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 11 [2018-11-10 05:43:59,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:43:59,660 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-10 05:43:59,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:43:59,660 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-10 05:43:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 05:43:59,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:43:59,660 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:59,660 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:43:59,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1925865547, now seen corresponding path program 1 times [2018-11-10 05:43:59,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:59,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:59,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:59,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:59,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:59,680 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 05:43:59,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:43:59,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:43:59,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:43:59,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:43:59,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:43:59,681 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 4 states. [2018-11-10 05:43:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:43:59,731 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-10 05:43:59,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:43:59,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-10 05:43:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:43:59,732 INFO L225 Difference]: With dead ends: 34 [2018-11-10 05:43:59,732 INFO L226 Difference]: Without dead ends: 33 [2018-11-10 05:43:59,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:43:59,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-10 05:43:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2018-11-10 05:43:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 05:43:59,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-10 05:43:59,736 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 12 [2018-11-10 05:43:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:43:59,736 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-10 05:43:59,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:43:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-10 05:43:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 05:43:59,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:43:59,737 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:59,737 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:43:59,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:59,737 INFO L82 PathProgramCache]: Analyzing trace with hash -427710131, now seen corresponding path program 1 times [2018-11-10 05:43:59,737 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:59,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:59,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:59,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:59,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:59,782 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 05:43:59,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:43:59,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:43:59,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:43:59,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:43:59,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:43:59,783 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 4 states. [2018-11-10 05:43:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:43:59,808 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-10 05:43:59,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:43:59,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-10 05:43:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:43:59,809 INFO L225 Difference]: With dead ends: 34 [2018-11-10 05:43:59,809 INFO L226 Difference]: Without dead ends: 33 [2018-11-10 05:43:59,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:43:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-10 05:43:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-11-10 05:43:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 05:43:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-10 05:43:59,812 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 13 [2018-11-10 05:43:59,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:43:59,812 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-10 05:43:59,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:43:59,812 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-10 05:43:59,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 05:43:59,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:43:59,812 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:59,812 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:43:59,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:59,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1255492539, now seen corresponding path program 1 times [2018-11-10 05:43:59,813 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:59,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:59,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:59,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:59,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:59,853 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 05:43:59,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:43:59,854 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:43:59,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:59,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:43:59,919 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 05:43:59,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:43:59,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-11-10 05:43:59,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:43:59,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:43:59,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:43:59,946 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2018-11-10 05:44:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:00,023 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-10 05:44:00,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:44:00,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-10 05:44:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:00,024 INFO L225 Difference]: With dead ends: 37 [2018-11-10 05:44:00,024 INFO L226 Difference]: Without dead ends: 36 [2018-11-10 05:44:00,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:44:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-10 05:44:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-11-10 05:44:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 05:44:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-10 05:44:00,027 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 16 [2018-11-10 05:44:00,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:00,027 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-10 05:44:00,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:44:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-10 05:44:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 05:44:00,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:00,028 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:00,028 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:00,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:00,028 INFO L82 PathProgramCache]: Analyzing trace with hash 265563093, now seen corresponding path program 1 times [2018-11-10 05:44:00,028 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:00,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:00,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:00,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:44:00,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:00,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:00,049 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:00,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:44:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:00,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:00,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:44:00,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2018-11-10 05:44:00,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:44:00,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:44:00,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:44:00,116 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 8 states. [2018-11-10 05:44:00,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:00,212 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-10 05:44:00,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 05:44:00,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-10 05:44:00,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:00,213 INFO L225 Difference]: With dead ends: 35 [2018-11-10 05:44:00,213 INFO L226 Difference]: Without dead ends: 34 [2018-11-10 05:44:00,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:44:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-10 05:44:00,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2018-11-10 05:44:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 05:44:00,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-10 05:44:00,217 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 17 [2018-11-10 05:44:00,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:00,217 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-10 05:44:00,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:44:00,217 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-10 05:44:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 05:44:00,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:00,218 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:00,218 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:00,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:00,218 INFO L82 PathProgramCache]: Analyzing trace with hash -357478659, now seen corresponding path program 1 times [2018-11-10 05:44:00,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:00,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:00,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:00,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:44:00,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:00,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:00,252 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:00,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:44:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:00,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:00,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:00,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 05:44:00,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:44:00,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:44:00,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:44:00,286 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 5 states. [2018-11-10 05:44:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:00,337 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-10 05:44:00,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:44:00,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-10 05:44:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:00,338 INFO L225 Difference]: With dead ends: 37 [2018-11-10 05:44:00,338 INFO L226 Difference]: Without dead ends: 36 [2018-11-10 05:44:00,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:44:00,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-10 05:44:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-11-10 05:44:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 05:44:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-10 05:44:00,341 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 18 [2018-11-10 05:44:00,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:00,341 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-10 05:44:00,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:44:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-10 05:44:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 05:44:00,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:00,342 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:00,343 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:00,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:00,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1803063511, now seen corresponding path program 1 times [2018-11-10 05:44:00,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:00,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:00,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:00,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:44:00,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:00,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:44:00,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:44:00,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:44:00,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:44:00,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:44:00,364 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 3 states. [2018-11-10 05:44:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:00,372 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-10 05:44:00,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:44:00,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 05:44:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:00,373 INFO L225 Difference]: With dead ends: 31 [2018-11-10 05:44:00,373 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 05:44:00,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:44:00,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 05:44:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-10 05:44:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 05:44:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-10 05:44:00,376 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 19 [2018-11-10 05:44:00,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:00,377 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-10 05:44:00,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:44:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-10 05:44:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 05:44:00,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:00,377 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:00,378 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:00,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:00,378 INFO L82 PathProgramCache]: Analyzing trace with hash 60394047, now seen corresponding path program 1 times [2018-11-10 05:44:00,378 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:00,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:00,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:00,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:44:00,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:00,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:00,424 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:00,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:44:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:00,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:00,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:00,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 05:44:00,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:44:00,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:44:00,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:44:00,457 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 5 states. [2018-11-10 05:44:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:00,513 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-10 05:44:00,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:44:00,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-10 05:44:00,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:00,514 INFO L225 Difference]: With dead ends: 39 [2018-11-10 05:44:00,515 INFO L226 Difference]: Without dead ends: 38 [2018-11-10 05:44:00,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:44:00,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-10 05:44:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-11-10 05:44:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 05:44:00,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-10 05:44:00,517 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 20 [2018-11-10 05:44:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:00,518 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-10 05:44:00,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:44:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-10 05:44:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 05:44:00,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:00,518 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:00,519 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:00,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1872215513, now seen corresponding path program 1 times [2018-11-10 05:44:00,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:00,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:00,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:00,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:44:00,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:00,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:00,542 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:00,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:44:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:00,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:00,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:00,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-11-10 05:44:00,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:44:00,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:44:00,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:44:00,602 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 7 states. [2018-11-10 05:44:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:00,678 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-10 05:44:00,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 05:44:00,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-10 05:44:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:00,679 INFO L225 Difference]: With dead ends: 43 [2018-11-10 05:44:00,679 INFO L226 Difference]: Without dead ends: 42 [2018-11-10 05:44:00,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:44:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-10 05:44:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2018-11-10 05:44:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 05:44:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-10 05:44:00,682 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 21 [2018-11-10 05:44:00,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:00,682 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-10 05:44:00,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:44:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-10 05:44:00,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 05:44:00,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:00,682 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:00,683 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:00,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:00,683 INFO L82 PathProgramCache]: Analyzing trace with hash 727079855, now seen corresponding path program 2 times [2018-11-10 05:44:00,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:00,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:00,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:00,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:44:00,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:00,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:00,738 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:00,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 05:44:00,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 05:44:00,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:44:00,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:00,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:00,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-11-10 05:44:00,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 05:44:00,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 05:44:00,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:44:00,846 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 15 states. [2018-11-10 05:44:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:00,919 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-10 05:44:00,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:44:00,919 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-11-10 05:44:00,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:00,920 INFO L225 Difference]: With dead ends: 31 [2018-11-10 05:44:00,920 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 05:44:00,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-11-10 05:44:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 05:44:00,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-10 05:44:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 05:44:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-10 05:44:00,922 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 24 [2018-11-10 05:44:00,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:00,922 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-10 05:44:00,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 05:44:00,923 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-10 05:44:00,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 05:44:00,923 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:00,923 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:00,923 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:00,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:00,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1355927055, now seen corresponding path program 2 times [2018-11-10 05:44:00,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:00,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:00,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:00,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:44:00,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:00,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:00,951 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:00,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 05:44:00,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 05:44:00,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:44:00,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:00,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:00,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-10 05:44:00,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 05:44:00,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:44:00,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:44:00,991 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 6 states. [2018-11-10 05:44:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:01,029 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-10 05:44:01,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:44:01,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-10 05:44:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:01,030 INFO L225 Difference]: With dead ends: 41 [2018-11-10 05:44:01,030 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 05:44:01,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:44:01,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 05:44:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-11-10 05:44:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 05:44:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-10 05:44:01,034 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 26 [2018-11-10 05:44:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:01,034 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-10 05:44:01,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 05:44:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-10 05:44:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 05:44:01,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:01,035 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:01,035 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:01,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:01,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1670807501, now seen corresponding path program 2 times [2018-11-10 05:44:01,036 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:01,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:01,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:01,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:44:01,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:01,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:01,077 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:01,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 05:44:01,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 05:44:01,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:44:01,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:01,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:01,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 05:44:01,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:44:01,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:44:01,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:44:01,117 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 7 states. [2018-11-10 05:44:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:01,165 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-10 05:44:01,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:44:01,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-11-10 05:44:01,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:01,166 INFO L225 Difference]: With dead ends: 44 [2018-11-10 05:44:01,166 INFO L226 Difference]: Without dead ends: 43 [2018-11-10 05:44:01,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:44:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-10 05:44:01,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-11-10 05:44:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 05:44:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-10 05:44:01,168 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 28 [2018-11-10 05:44:01,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:01,168 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-10 05:44:01,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:44:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-10 05:44:01,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 05:44:01,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:01,169 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:01,169 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:01,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:01,169 INFO L82 PathProgramCache]: Analyzing trace with hash -220012315, now seen corresponding path program 3 times [2018-11-10 05:44:01,170 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:01,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:01,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:01,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:44:01,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:01,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:01,217 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:01,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:44:01,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 05:44:01,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:44:01,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:01,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:01,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-11-10 05:44:01,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 05:44:01,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 05:44:01,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:44:01,308 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 15 states. [2018-11-10 05:44:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:01,503 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-10 05:44:01,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 05:44:01,503 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-10 05:44:01,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:01,503 INFO L225 Difference]: With dead ends: 49 [2018-11-10 05:44:01,504 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 05:44:01,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2018-11-10 05:44:01,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 05:44:01,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-11-10 05:44:01,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 05:44:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-10 05:44:01,507 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 34 [2018-11-10 05:44:01,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:01,507 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-10 05:44:01,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 05:44:01,507 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-10 05:44:01,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 05:44:01,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:01,508 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:01,508 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:01,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:01,508 INFO L82 PathProgramCache]: Analyzing trace with hash -978435545, now seen corresponding path program 3 times [2018-11-10 05:44:01,508 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:01,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:01,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:01,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:44:01,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:01,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:01,539 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:01,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:44:01,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 05:44:01,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:44:01,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:01,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:01,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-11-10 05:44:01,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 05:44:01,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 05:44:01,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:44:01,662 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 15 states. [2018-11-10 05:44:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:01,806 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-10 05:44:01,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 05:44:01,806 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-11-10 05:44:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:01,806 INFO L225 Difference]: With dead ends: 70 [2018-11-10 05:44:01,806 INFO L226 Difference]: Without dead ends: 68 [2018-11-10 05:44:01,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2018-11-10 05:44:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-10 05:44:01,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2018-11-10 05:44:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 05:44:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-11-10 05:44:01,811 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 36 [2018-11-10 05:44:01,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:01,811 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-10 05:44:01,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 05:44:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-10 05:44:01,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 05:44:01,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:01,812 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:01,812 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:01,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:01,812 INFO L82 PathProgramCache]: Analyzing trace with hash -909925683, now seen corresponding path program 4 times [2018-11-10 05:44:01,812 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:01,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:01,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:01,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:44:01,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:01,877 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:01,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:01,877 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:01,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 05:44:01,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 05:44:01,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:44:01,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:01,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:01,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-10 05:44:01,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 05:44:01,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:44:01,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:44:01,919 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 11 states. [2018-11-10 05:44:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:01,997 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-10 05:44:01,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 05:44:01,997 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-10 05:44:01,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:01,997 INFO L225 Difference]: With dead ends: 64 [2018-11-10 05:44:01,997 INFO L226 Difference]: Without dead ends: 63 [2018-11-10 05:44:01,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-11-10 05:44:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-10 05:44:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-10 05:44:02,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 05:44:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-11-10 05:44:02,002 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 50 [2018-11-10 05:44:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:02,003 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-11-10 05:44:02,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 05:44:02,003 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-10 05:44:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 05:44:02,003 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:02,003 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:02,004 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:02,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:02,004 INFO L82 PathProgramCache]: Analyzing trace with hash 64468417, now seen corresponding path program 5 times [2018-11-10 05:44:02,004 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:02,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:02,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:02,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:44:02,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:02,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:02,082 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:02,099 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 05:44:02,118 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-10 05:44:02,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:44:02,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:02,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:02,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-10 05:44:02,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 05:44:02,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 05:44:02,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:44:02,144 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 12 states. [2018-11-10 05:44:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:02,254 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-11-10 05:44:02,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 05:44:02,255 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-10 05:44:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:02,255 INFO L225 Difference]: With dead ends: 73 [2018-11-10 05:44:02,255 INFO L226 Difference]: Without dead ends: 72 [2018-11-10 05:44:02,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2018-11-10 05:44:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-10 05:44:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-11-10 05:44:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 05:44:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-11-10 05:44:02,260 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 58 [2018-11-10 05:44:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:02,260 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-11-10 05:44:02,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 05:44:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-10 05:44:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 05:44:02,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:02,261 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:02,261 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:02,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:02,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1824608259, now seen corresponding path program 4 times [2018-11-10 05:44:02,261 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:02,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:02,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:02,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:44:02,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:02,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:02,319 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:02,326 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 05:44:02,350 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 05:44:02,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:44:02,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:02,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:02,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-10 05:44:02,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 05:44:02,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 05:44:02,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:44:02,376 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 13 states. [2018-11-10 05:44:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:02,499 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-10 05:44:02,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:44:02,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-11-10 05:44:02,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:02,500 INFO L225 Difference]: With dead ends: 76 [2018-11-10 05:44:02,500 INFO L226 Difference]: Without dead ends: 75 [2018-11-10 05:44:02,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2018-11-10 05:44:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-10 05:44:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-11-10 05:44:02,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 05:44:02,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-11-10 05:44:02,505 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 60 [2018-11-10 05:44:02,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:02,505 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-11-10 05:44:02,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 05:44:02,505 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-11-10 05:44:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 05:44:02,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:02,506 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:02,506 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:02,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash 183735477, now seen corresponding path program 6 times [2018-11-10 05:44:02,506 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:02,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:02,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:02,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:44:02,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:02,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:02,615 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:02,628 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 05:44:02,647 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-10 05:44:02,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:44:02,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:02,957 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 12 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:02,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:02,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 31 [2018-11-10 05:44:02,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-10 05:44:02,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-10 05:44:02,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-11-10 05:44:02,975 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 32 states. [2018-11-10 05:44:04,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:04,246 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2018-11-10 05:44:04,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-10 05:44:04,246 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2018-11-10 05:44:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:04,246 INFO L225 Difference]: With dead ends: 90 [2018-11-10 05:44:04,246 INFO L226 Difference]: Without dead ends: 89 [2018-11-10 05:44:04,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=605, Invalid=4225, Unknown=0, NotChecked=0, Total=4830 [2018-11-10 05:44:04,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-10 05:44:04,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-11-10 05:44:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 05:44:04,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-11-10 05:44:04,252 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 66 [2018-11-10 05:44:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:04,252 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-11-10 05:44:04,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-10 05:44:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-10 05:44:04,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 05:44:04,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:04,253 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:04,253 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:04,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:04,253 INFO L82 PathProgramCache]: Analyzing trace with hash 476135927, now seen corresponding path program 5 times [2018-11-10 05:44:04,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:04,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:04,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:04,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:44:04,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:04,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:04,325 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:04,334 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 05:44:04,346 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-10 05:44:04,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:44:04,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:04,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:04,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-10 05:44:04,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:44:04,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:44:04,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:44:04,372 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 14 states. [2018-11-10 05:44:04,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:04,523 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-11-10 05:44:04,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 05:44:04,524 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2018-11-10 05:44:04,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:04,525 INFO L225 Difference]: With dead ends: 92 [2018-11-10 05:44:04,525 INFO L226 Difference]: Without dead ends: 91 [2018-11-10 05:44:04,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=208, Invalid=442, Unknown=0, NotChecked=0, Total=650 [2018-11-10 05:44:04,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-10 05:44:04,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-11-10 05:44:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 05:44:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-11-10 05:44:04,531 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 68 [2018-11-10 05:44:04,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:04,531 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-11-10 05:44:04,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:44:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-11-10 05:44:04,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 05:44:04,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:04,532 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:04,532 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:04,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:04,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1888173993, now seen corresponding path program 7 times [2018-11-10 05:44:04,532 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:04,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:04,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:04,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:44:04,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:04,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:04,619 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:04,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:44:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:04,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:04,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:04,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-10 05:44:04,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 05:44:04,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 05:44:04,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:44:04,658 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 15 states. [2018-11-10 05:44:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:04,792 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-11-10 05:44:04,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 05:44:04,792 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 74 [2018-11-10 05:44:04,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:04,793 INFO L225 Difference]: With dead ends: 97 [2018-11-10 05:44:04,793 INFO L226 Difference]: Without dead ends: 96 [2018-11-10 05:44:04,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=241, Invalid=515, Unknown=0, NotChecked=0, Total=756 [2018-11-10 05:44:04,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-10 05:44:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-11-10 05:44:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 05:44:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-11-10 05:44:04,798 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 74 [2018-11-10 05:44:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:04,799 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-11-10 05:44:04,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 05:44:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-11-10 05:44:04,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 05:44:04,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:04,799 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:04,800 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:04,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:04,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2059010027, now seen corresponding path program 6 times [2018-11-10 05:44:04,800 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:04,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:04,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:04,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:44:04,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:04,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:04,875 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:04,883 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 05:44:04,901 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-10 05:44:04,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:44:04,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 64 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:05,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:05,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 39 [2018-11-10 05:44:05,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-10 05:44:05,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-10 05:44:05,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1424, Unknown=0, NotChecked=0, Total=1560 [2018-11-10 05:44:05,218 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 40 states. [2018-11-10 05:44:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:06,069 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-11-10 05:44:06,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 05:44:06,069 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-11-10 05:44:06,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:06,070 INFO L225 Difference]: With dead ends: 99 [2018-11-10 05:44:06,070 INFO L226 Difference]: Without dead ends: 98 [2018-11-10 05:44:06,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=788, Invalid=3372, Unknown=0, NotChecked=0, Total=4160 [2018-11-10 05:44:06,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-10 05:44:06,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2018-11-10 05:44:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-10 05:44:06,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-11-10 05:44:06,076 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 76 [2018-11-10 05:44:06,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:06,076 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-11-10 05:44:06,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-10 05:44:06,077 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-11-10 05:44:06,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 05:44:06,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:06,077 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:06,078 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:06,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:06,078 INFO L82 PathProgramCache]: Analyzing trace with hash 419297681, now seen corresponding path program 8 times [2018-11-10 05:44:06,078 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:06,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:06,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:06,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:44:06,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:06,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:06,202 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:06,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 05:44:06,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 05:44:06,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:44:06,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:06,244 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:06,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:06,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-11-10 05:44:06,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 05:44:06,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 05:44:06,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-10 05:44:06,270 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 18 states. [2018-11-10 05:44:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:06,477 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-11-10 05:44:06,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 05:44:06,477 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 90 [2018-11-10 05:44:06,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:06,478 INFO L225 Difference]: With dead ends: 111 [2018-11-10 05:44:06,478 INFO L226 Difference]: Without dead ends: 110 [2018-11-10 05:44:06,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=352, Invalid=770, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 05:44:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-10 05:44:06,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2018-11-10 05:44:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-10 05:44:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-11-10 05:44:06,483 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 90 [2018-11-10 05:44:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:06,483 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-11-10 05:44:06,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 05:44:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-11-10 05:44:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 05:44:06,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:44:06,484 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-11-10 05:44:06,484 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:44:06,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:44:06,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2026890105, now seen corresponding path program 9 times [2018-11-10 05:44:06,485 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:44:06,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:44:06,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:06,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:44:06,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:44:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:06,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:44:06,637 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:44:06,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:44:06,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-10 05:44:06,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:44:06,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:44:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 318 proven. 138 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-10 05:44:13,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:44:13,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-11-10 05:44:13,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-10 05:44:13,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-10 05:44:13,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1414, Unknown=8, NotChecked=0, Total=1560 [2018-11-10 05:44:13,265 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 40 states. [2018-11-10 05:44:14,947 WARN L179 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2018-11-10 05:44:18,312 WARN L179 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2018-11-10 05:44:25,337 WARN L179 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2018-11-10 05:44:25,869 WARN L179 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2018-11-10 05:44:32,239 WARN L179 SmtUtils]: Spent 932.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2018-11-10 05:44:35,516 WARN L179 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2018-11-10 05:44:38,875 WARN L179 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2018-11-10 05:44:40,692 WARN L179 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2018-11-10 05:44:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:44:57,124 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2018-11-10 05:44:57,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-10 05:44:57,124 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 106 [2018-11-10 05:44:57,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:44:57,125 INFO L225 Difference]: With dead ends: 126 [2018-11-10 05:44:57,125 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 05:44:57,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 87 SyntacticMatches, 10 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3430 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=2219, Invalid=9747, Unknown=24, NotChecked=0, Total=11990 [2018-11-10 05:44:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 05:44:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 05:44:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 05:44:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 05:44:57,127 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2018-11-10 05:44:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:44:57,127 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:44:57,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-10 05:44:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:44:57,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 05:44:57,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 05:44:57,240 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 200 [2018-11-10 05:44:58,338 WARN L179 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 199 DAG size of output: 93 [2018-11-10 05:44:58,339 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 05:44:58,339 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:44:58,339 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:44:58,340 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 05:44:58,340 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 05:44:58,340 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:44:58,340 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-10 05:44:58,340 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 16 29) no Hoare annotation was computed. [2018-11-10 05:44:58,340 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-11-10 05:44:58,340 INFO L425 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-10 05:44:58,340 INFO L425 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-11-10 05:44:58,340 INFO L425 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-10 05:44:58,340 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-11-10 05:44:58,340 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 16 29) no Hoare annotation was computed. [2018-11-10 05:44:58,340 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2018-11-10 05:44:58,340 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 16 29) the Hoare annotation is: true [2018-11-10 05:44:58,340 INFO L425 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-11-10 05:44:58,340 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-10 05:44:58,340 INFO L425 ceAbstractionStarter]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2018-11-10 05:44:58,340 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-11-10 05:44:58,340 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-11-10 05:44:58,341 INFO L421 ceAbstractionStarter]: At program point L22-3(lines 22 27) the Hoare annotation is: (let ((.cse25 (+ main_~d2~0 main_~x~0)) (.cse22 (+ main_~d1old~0 main_~x~0))) (let ((.cse1 (<= 74 main_~d2~0)) (.cse0 (<= main_~d2~0 74)) (.cse18 (<= main_~d1~0 75)) (.cse20 (<= 75 main_~d1~0)) (.cse10 (<= main_~d1old~0 77)) (.cse14 (<= main_~d2~0 78)) (.cse15 (<= 77 main_~d1old~0)) (.cse11 (<= 78 main_~d2~0)) (.cse9 (<= 79 main_~d1~0)) (.cse3 (<= main_~d1old~0 79)) (.cse13 (<= main_~d1~0 79)) (.cse4 (<= main_~d2~0 80)) (.cse2 (<= 80 main_~d2~0)) (.cse12 (<= 0 .cse22)) (.cse5 (<= 79 main_~d1old~0)) (.cse7 (<= 81 main_~d1~0)) (.cse8 (<= .cse25 2147483192)) (.cse16 (<= main_~d1old~0 75)) (.cse17 (<= main_~d2~0 76)) (.cse23 (<= main_~d1~0 77)) (.cse6 (<= 1 .cse25)) (.cse19 (<= 76 main_~d2~0)) (.cse24 (<= 77 main_~d1~0)) (.cse21 (<= 75 main_~d1old~0))) (or (and (<= main_~d1~0 73) .cse0 (<= main_~x~0 (+ main_~d1~0 2147483574)) .cse1 (<= 73 main_~d1~0)) (and .cse2 .cse3 (<= main_~d1~0 81) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 (<= main_~x~0 2147483270) .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 (<= main_~x~0 2147483499) .cse18 .cse6 .cse19 .cse20 .cse21) (and (<= .cse22 2147483647) .cse1 (<= main_~d1old~0 73) .cse0 .cse18 (<= 73 main_~d1old~0) .cse6 .cse20) (and .cse23 .cse10 (<= main_~x~0 2147483347) .cse14 .cse6 .cse15 .cse24 .cse11) (and .cse2 .cse9 .cse3 .cse13 .cse4 (<= main_~x~0 2147483191) .cse5 .cse6) (and .cse2 .cse12 (<= (+ main_~x~0 main_~d1~0) 2147483112) (and (<= (+ main_~d2~0 main_~x~0 main_~d1~0) 2147483573) (<= (+ main_~d1old~0 main_~x~0 main_~d1~0) 2147483572)) .cse5 (<= .cse22 2147483191) (exists ((v_main_~x~0_36 Int)) (and (<= (+ main_~d2~0 (* 2 v_main_~x~0_36)) 6442450936) (<= (+ main_~d2~0 main_~x~0) (+ v_main_~x~0_36 1)))) (<= main_~d1old~0 2147483112) .cse6 .cse7 .cse8) (and .cse16 .cse17 .cse23 (<= .cse22 2147483499) .cse6 .cse19 .cse24 .cse21)))) [2018-11-10 05:44:58,341 INFO L425 ceAbstractionStarter]: For program point L22-4(lines 22 27) no Hoare annotation was computed. [2018-11-10 05:44:58,341 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2018-11-10 05:44:58,344 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_36,QUANTIFIED] [2018-11-10 05:44:58,345 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_36,QUANTIFIED] [2018-11-10 05:44:58,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_36,QUANTIFIED] [2018-11-10 05:44:58,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_36,QUANTIFIED] [2018-11-10 05:44:58,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:44:58 BoogieIcfgContainer [2018-11-10 05:44:58,354 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 05:44:58,354 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:44:58,354 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:44:58,355 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:44:58,355 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:43:59" (3/4) ... [2018-11-10 05:44:58,360 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 05:44:58,366 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 05:44:58,366 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 05:44:58,370 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 05:44:58,370 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 05:44:58,370 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 05:44:58,370 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 05:44:58,390 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((d1 <= 73 && d2 <= 74) && x <= d1 + 2147483574) && 74 <= d2) && 73 <= d1) || (((((((80 <= d2 && d1\old <= 79) && d1 <= 81) && d2 <= 80) && 79 <= d1\old) && 1 <= d2 + x) && 81 <= d1) && d2 + x <= 2147483192)) || (((((((79 <= d1 && d1\old <= 77) && x <= 2147483270) && 78 <= d2) && 0 <= d1\old + x) && d1 <= 79) && d2 <= 78) && 77 <= d1\old)) || (((((((d1\old <= 75 && d2 <= 76) && x <= 2147483499) && d1 <= 75) && 1 <= d2 + x) && 76 <= d2) && 75 <= d1) && 75 <= d1\old)) || (((((((d1\old + x <= 2147483647 && 74 <= d2) && d1\old <= 73) && d2 <= 74) && d1 <= 75) && 73 <= d1\old) && 1 <= d2 + x) && 75 <= d1)) || (((((((d1 <= 77 && d1\old <= 77) && x <= 2147483347) && d2 <= 78) && 1 <= d2 + x) && 77 <= d1\old) && 77 <= d1) && 78 <= d2)) || (((((((80 <= d2 && 79 <= d1) && d1\old <= 79) && d1 <= 79) && d2 <= 80) && x <= 2147483191) && 79 <= d1\old) && 1 <= d2 + x)) || ((((((((((80 <= d2 && 0 <= d1\old + x) && x + d1 <= 2147483112) && d2 + x + d1 <= 2147483573 && d1\old + x + d1 <= 2147483572) && 79 <= d1\old) && d1\old + x <= 2147483191) && (\exists v_main_~x~0_36 : int :: d2 + 2 * v_main_~x~0_36 <= 6442450936 && d2 + x <= v_main_~x~0_36 + 1)) && d1\old <= 2147483112) && 1 <= d2 + x) && 81 <= d1) && d2 + x <= 2147483192)) || (((((((d1\old <= 75 && d2 <= 76) && d1 <= 77) && d1\old + x <= 2147483499) && 1 <= d2 + x) && 76 <= d2) && 77 <= d1) && 75 <= d1\old) [2018-11-10 05:44:58,396 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_94aebc2c-a0f1-429e-8c10-32b2c7afaa3e/bin-2019/uautomizer/witness.graphml [2018-11-10 05:44:58,396 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:44:58,397 INFO L168 Benchmark]: Toolchain (without parser) took 59497.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 54.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:44:58,397 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:44:58,397 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.81 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:44:58,398 INFO L168 Benchmark]: Boogie Preprocessor took 17.38 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:44:58,398 INFO L168 Benchmark]: RCFGBuilder took 174.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:44:58,398 INFO L168 Benchmark]: TraceAbstraction took 59107.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.7 MB). Peak memory consumption was 375.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:44:58,398 INFO L168 Benchmark]: Witness Printer took 41.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:44:58,400 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.81 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.38 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 174.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59107.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.7 MB). Peak memory consumption was 375.5 MB. Max. memory is 11.5 GB. * Witness Printer took 41.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_36,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: 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 - InvariantResult [Line: 22]: Loop Invariant [2018-11-10 05:44:58,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_36,QUANTIFIED] [2018-11-10 05:44:58,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_36,QUANTIFIED] [2018-11-10 05:44:58,407 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_36,QUANTIFIED] [2018-11-10 05:44:58,407 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_36,QUANTIFIED] Derived loop invariant: (((((((((((d1 <= 73 && d2 <= 74) && x <= d1 + 2147483574) && 74 <= d2) && 73 <= d1) || (((((((80 <= d2 && d1\old <= 79) && d1 <= 81) && d2 <= 80) && 79 <= d1\old) && 1 <= d2 + x) && 81 <= d1) && d2 + x <= 2147483192)) || (((((((79 <= d1 && d1\old <= 77) && x <= 2147483270) && 78 <= d2) && 0 <= d1\old + x) && d1 <= 79) && d2 <= 78) && 77 <= d1\old)) || (((((((d1\old <= 75 && d2 <= 76) && x <= 2147483499) && d1 <= 75) && 1 <= d2 + x) && 76 <= d2) && 75 <= d1) && 75 <= d1\old)) || (((((((d1\old + x <= 2147483647 && 74 <= d2) && d1\old <= 73) && d2 <= 74) && d1 <= 75) && 73 <= d1\old) && 1 <= d2 + x) && 75 <= d1)) || (((((((d1 <= 77 && d1\old <= 77) && x <= 2147483347) && d2 <= 78) && 1 <= d2 + x) && 77 <= d1\old) && 77 <= d1) && 78 <= d2)) || (((((((80 <= d2 && 79 <= d1) && d1\old <= 79) && d1 <= 79) && d2 <= 80) && x <= 2147483191) && 79 <= d1\old) && 1 <= d2 + x)) || ((((((((((80 <= d2 && 0 <= d1\old + x) && x + d1 <= 2147483112) && d2 + x + d1 <= 2147483573 && d1\old + x + d1 <= 2147483572) && 79 <= d1\old) && d1\old + x <= 2147483191) && (\exists v_main_~x~0_36 : int :: d2 + 2 * v_main_~x~0_36 <= 6442450936 && d2 + x <= v_main_~x~0_36 + 1)) && d1\old <= 2147483112) && 1 <= d2 + x) && 81 <= d1) && d2 + x <= 2147483192)) || (((((((d1\old <= 75 && d2 <= 76) && d1 <= 77) && d1\old + x <= 2147483499) && 1 <= d2 + x) && 76 <= d2) && 77 <= d1) && 75 <= d1\old) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 6 error locations. SAFE Result, 59.0s OverallTime, 26 OverallIterations, 13 TraceHistogramMax, 47.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 346 SDtfs, 1787 SDslu, 1710 SDs, 0 SdLazy, 3772 SolverSat, 919 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1343 GetRequests, 810 SyntacticMatches, 10 SemanticMatches, 523 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 6057 ImplicationChecksByTransitivity, 46.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 119 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 19 NumberOfFragments, 285 HoareAnnotationTreeSize, 5 FomulaSimplifications, 5465 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 11882 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 1858 NumberOfCodeBlocks, 1810 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 1813 ConstructedInterpolants, 35 QuantifiedInterpolants, 392986 SizeOfPredicates, 153 NumberOfNonLiveVariables, 1805 ConjunctsInSsa, 225 ConjunctsInUnsatCore, 45 InterpolantComputations, 8 PerfectInterpolantSequences, 546/5094 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...