./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1b_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_632b6254-2403-4160-ae0f-ed7d6b943b74/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/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 9072a9376e1e28de1ef4dc11b7134f6f175023b7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:19:52,486 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:19:52,487 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:19:52,495 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:19:52,495 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:19:52,496 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:19:52,497 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:19:52,498 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:19:52,499 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:19:52,500 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:19:52,501 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:19:52,501 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:19:52,502 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:19:52,503 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:19:52,503 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:19:52,504 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:19:52,505 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:19:52,506 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:19:52,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:19:52,508 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:19:52,509 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:19:52,510 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:19:52,512 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:19:52,512 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:19:52,512 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:19:52,513 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:19:52,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:19:52,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:19:52,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:19:52,515 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:19:52,516 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:19:52,516 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:19:52,516 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:19:52,516 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:19:52,517 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:19:52,518 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:19:52,518 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-10 12:19:52,529 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:19:52,529 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:19:52,529 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:19:52,529 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:19:52,530 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:19:52,530 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:19:52,530 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:19:52,530 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:19:52,531 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:19:52,531 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:19:52,531 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:19:52,531 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:19:52,531 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:19:52,531 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:19:52,531 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 12:19:52,532 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:19:52,532 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:19:52,532 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:19:52,532 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:19:52,532 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:19:52,532 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:19:52,532 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:19:52,533 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:19:52,533 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:19:52,533 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:19:52,533 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:19:52,533 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:19:52,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:19:52,533 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_632b6254-2403-4160-ae0f-ed7d6b943b74/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 -> 9072a9376e1e28de1ef4dc11b7134f6f175023b7 [2018-11-10 12:19:52,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:19:52,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:19:52,568 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:19:52,569 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:19:52,570 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:19:52,570 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 12:19:52,608 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/bin-2019/uautomizer/data/5f50f86be/fdc956b7f4094fcdb9f9d2bb98ec0392/FLAG3a7b9b0e6 [2018-11-10 12:19:52,951 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:19:52,952 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/sv-benchmarks/c/termination-crafted/MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 12:19:52,957 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/bin-2019/uautomizer/data/5f50f86be/fdc956b7f4094fcdb9f9d2bb98ec0392/FLAG3a7b9b0e6 [2018-11-10 12:19:52,966 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/bin-2019/uautomizer/data/5f50f86be/fdc956b7f4094fcdb9f9d2bb98ec0392 [2018-11-10 12:19:52,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:19:52,970 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:19:52,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:19:52,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:19:52,975 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:19:52,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:19:52" (1/1) ... [2018-11-10 12:19:52,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe532c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:52, skipping insertion in model container [2018-11-10 12:19:52,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:19:52" (1/1) ... [2018-11-10 12:19:52,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:19:53,002 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:19:53,098 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:19:53,101 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:19:53,113 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:19:53,121 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:19:53,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:53 WrapperNode [2018-11-10 12:19:53,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:19:53,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:19:53,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:19:53,122 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:19:53,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:53" (1/1) ... [2018-11-10 12:19:53,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:53" (1/1) ... [2018-11-10 12:19:53,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:53" (1/1) ... [2018-11-10 12:19:53,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:53" (1/1) ... [2018-11-10 12:19:53,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:53" (1/1) ... [2018-11-10 12:19:53,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:53" (1/1) ... [2018-11-10 12:19:53,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:53" (1/1) ... [2018-11-10 12:19:53,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:19:53,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:19:53,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:19:53,140 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:19:53,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/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 12:19:53,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:19:53,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:19:53,216 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-10 12:19:53,216 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-10 12:19:53,216 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:19:53,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 12:19:53,216 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-10 12:19:53,216 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-10 12:19:53,217 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:19:53,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:19:53,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:19:53,345 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:19:53,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:19:53 BoogieIcfgContainer [2018-11-10 12:19:53,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:19:53,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:19:53,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:19:53,348 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:19:53,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:19:52" (1/3) ... [2018-11-10 12:19:53,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb644a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:19:53, skipping insertion in model container [2018-11-10 12:19:53,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:19:53" (2/3) ... [2018-11-10 12:19:53,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb644a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:19:53, skipping insertion in model container [2018-11-10 12:19:53,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:19:53" (3/3) ... [2018-11-10 12:19:53,350 INFO L112 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 12:19:53,357 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:19:53,361 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-10 12:19:53,370 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-10 12:19:53,389 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:19:53,389 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:19:53,389 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:19:53,390 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:19:53,390 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:19:53,390 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:19:53,390 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:19:53,390 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:19:53,390 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:19:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-11-10 12:19:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 12:19:53,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:53,408 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:53,410 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:53,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:53,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1878681222, now seen corresponding path program 1 times [2018-11-10 12:19:53,414 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:53,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:53,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:53,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:53,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:53,518 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 12:19:53,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:19:53,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:19:53,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:19:53,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:19:53,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:19:53,532 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 5 states. [2018-11-10 12:19:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:53,621 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-11-10 12:19:53,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:19:53,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-10 12:19:53,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:53,631 INFO L225 Difference]: With dead ends: 69 [2018-11-10 12:19:53,631 INFO L226 Difference]: Without dead ends: 60 [2018-11-10 12:19:53,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:19:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-10 12:19:53,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-11-10 12:19:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 12:19:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-10 12:19:53,668 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 9 [2018-11-10 12:19:53,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:53,669 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-10 12:19:53,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:19:53,669 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-10 12:19:53,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 12:19:53,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:53,669 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:53,670 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:53,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:53,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1890424319, now seen corresponding path program 1 times [2018-11-10 12:19:53,670 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:53,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:53,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:53,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:53,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:53,687 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 12:19:53,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:19:53,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:19:53,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:19:53,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:19:53,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:19:53,689 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2018-11-10 12:19:53,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:53,710 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-10 12:19:53,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:19:53,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-10 12:19:53,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:53,711 INFO L225 Difference]: With dead ends: 56 [2018-11-10 12:19:53,711 INFO L226 Difference]: Without dead ends: 54 [2018-11-10 12:19:53,712 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 12:19:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-10 12:19:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-10 12:19:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 12:19:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-10 12:19:53,720 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 10 [2018-11-10 12:19:53,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:53,720 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-10 12:19:53,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:19:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-10 12:19:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 12:19:53,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:53,721 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:53,722 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:53,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:53,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1814880932, now seen corresponding path program 1 times [2018-11-10 12:19:53,722 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:53,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:53,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:53,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:53,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:19:53,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:19:53,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:19:53,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:19:53,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:19:53,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:19:53,788 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 7 states. [2018-11-10 12:19:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:53,901 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-10 12:19:53,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:19:53,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-10 12:19:53,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:53,903 INFO L225 Difference]: With dead ends: 71 [2018-11-10 12:19:53,903 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 12:19:53,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:19:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 12:19:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-11-10 12:19:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-10 12:19:53,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-11-10 12:19:53,911 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 17 [2018-11-10 12:19:53,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:53,912 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2018-11-10 12:19:53,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:19:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-11-10 12:19:53,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 12:19:53,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:53,913 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:53,913 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:53,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:53,914 INFO L82 PathProgramCache]: Analyzing trace with hash -2069922715, now seen corresponding path program 1 times [2018-11-10 12:19:53,914 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:53,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:53,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:53,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:53,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 12:19:53,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:19:53,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:19:53,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:19:53,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:19:53,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:19:53,941 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 5 states. [2018-11-10 12:19:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:53,996 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-11-10 12:19:53,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:19:53,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-10 12:19:53,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:53,997 INFO L225 Difference]: With dead ends: 81 [2018-11-10 12:19:53,997 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 12:19:53,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:19:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 12:19:54,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2018-11-10 12:19:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 12:19:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-11-10 12:19:54,007 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 20 [2018-11-10 12:19:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:54,007 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-11-10 12:19:54,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:19:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-10 12:19:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 12:19:54,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:54,008 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:54,008 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:54,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:54,009 INFO L82 PathProgramCache]: Analyzing trace with hash 256905316, now seen corresponding path program 1 times [2018-11-10 12:19:54,009 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:54,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:54,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:54,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:19:54,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:19:54,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:19:54,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:19:54,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:19:54,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:19:54,024 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 3 states. [2018-11-10 12:19:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:54,038 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-11-10 12:19:54,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:19:54,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 12:19:54,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:54,040 INFO L225 Difference]: With dead ends: 71 [2018-11-10 12:19:54,040 INFO L226 Difference]: Without dead ends: 70 [2018-11-10 12:19:54,040 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 12:19:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-10 12:19:54,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-10 12:19:54,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 12:19:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2018-11-10 12:19:54,048 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 21 [2018-11-10 12:19:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:54,048 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-11-10 12:19:54,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:19:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2018-11-10 12:19:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:19:54,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:54,050 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:54,050 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:54,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:54,050 INFO L82 PathProgramCache]: Analyzing trace with hash -831628633, now seen corresponding path program 1 times [2018-11-10 12:19:54,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:54,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:54,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:54,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 12:19:54,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:19:54,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:19:54,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:19:54,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:19:54,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:19:54,092 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand 5 states. [2018-11-10 12:19:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:54,164 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2018-11-10 12:19:54,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:19:54,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-10 12:19:54,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:54,165 INFO L225 Difference]: With dead ends: 127 [2018-11-10 12:19:54,165 INFO L226 Difference]: Without dead ends: 66 [2018-11-10 12:19:54,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:19:54,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-10 12:19:54,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-10 12:19:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 12:19:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-11-10 12:19:54,173 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 25 [2018-11-10 12:19:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:54,173 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-11-10 12:19:54,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:19:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-10 12:19:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:19:54,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:54,174 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:54,175 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:54,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:54,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1630439354, now seen corresponding path program 1 times [2018-11-10 12:19:54,175 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:54,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:54,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:54,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:19:54,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:19:54,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:19:54,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:19:54,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:19:54,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:19:54,215 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 5 states. [2018-11-10 12:19:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:54,260 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-11-10 12:19:54,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:19:54,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-10 12:19:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:54,262 INFO L225 Difference]: With dead ends: 76 [2018-11-10 12:19:54,262 INFO L226 Difference]: Without dead ends: 75 [2018-11-10 12:19:54,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:19:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-10 12:19:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-11-10 12:19:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 12:19:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2018-11-10 12:19:54,270 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 25 [2018-11-10 12:19:54,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:54,270 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2018-11-10 12:19:54,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:19:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2018-11-10 12:19:54,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 12:19:54,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:54,271 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:54,272 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:54,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:54,272 INFO L82 PathProgramCache]: Analyzing trace with hash -995987509, now seen corresponding path program 1 times [2018-11-10 12:19:54,272 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:54,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:54,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:54,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:54,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:19:54,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:19:54,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:19:54,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:19:54,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:19:54,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:19:54,311 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 5 states. [2018-11-10 12:19:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:54,344 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2018-11-10 12:19:54,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:19:54,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-10 12:19:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:54,345 INFO L225 Difference]: With dead ends: 79 [2018-11-10 12:19:54,345 INFO L226 Difference]: Without dead ends: 75 [2018-11-10 12:19:54,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:19:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-10 12:19:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-11-10 12:19:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 12:19:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2018-11-10 12:19:54,351 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 26 [2018-11-10 12:19:54,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:54,352 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2018-11-10 12:19:54,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:19:54,352 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2018-11-10 12:19:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 12:19:54,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:54,352 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:54,353 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:54,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:54,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1986621902, now seen corresponding path program 1 times [2018-11-10 12:19:54,353 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:54,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:54,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:54,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 12:19:54,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:19:54,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:19:54,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:19:54,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:19:54,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:19:54,404 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 7 states. [2018-11-10 12:19:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:54,489 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2018-11-10 12:19:54,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:19:54,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-10 12:19:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:54,490 INFO L225 Difference]: With dead ends: 111 [2018-11-10 12:19:54,490 INFO L226 Difference]: Without dead ends: 110 [2018-11-10 12:19:54,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:19:54,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-10 12:19:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 83. [2018-11-10 12:19:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 12:19:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2018-11-10 12:19:54,498 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 46 [2018-11-10 12:19:54,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:54,499 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2018-11-10 12:19:54,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:19:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2018-11-10 12:19:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 12:19:54,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:54,500 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:54,500 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:54,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:54,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1408540422, now seen corresponding path program 1 times [2018-11-10 12:19:54,500 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:54,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:54,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:54,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 12:19:54,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:19:54,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:19:54,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:19:54,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:19:54,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:19:54,546 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand 5 states. [2018-11-10 12:19:54,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:54,582 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-11-10 12:19:54,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:19:54,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-11-10 12:19:54,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:54,583 INFO L225 Difference]: With dead ends: 85 [2018-11-10 12:19:54,583 INFO L226 Difference]: Without dead ends: 84 [2018-11-10 12:19:54,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:19:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-10 12:19:54,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-10 12:19:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 12:19:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2018-11-10 12:19:54,592 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 51 [2018-11-10 12:19:54,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:54,593 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2018-11-10 12:19:54,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:19:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-11-10 12:19:54,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 12:19:54,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:54,594 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:54,595 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:54,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:54,595 INFO L82 PathProgramCache]: Analyzing trace with hash 859454554, now seen corresponding path program 1 times [2018-11-10 12:19:54,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:54,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:54,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:54,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 12:19:54,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:19:54,661 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/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 12:19:54,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:54,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:19:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 12:19:54,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:19:54,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-11-10 12:19:54,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:19:54,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:19:54,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:19:54,759 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand 10 states. [2018-11-10 12:19:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:54,824 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2018-11-10 12:19:54,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:19:54,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2018-11-10 12:19:54,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:54,827 INFO L225 Difference]: With dead ends: 118 [2018-11-10 12:19:54,827 INFO L226 Difference]: Without dead ends: 117 [2018-11-10 12:19:54,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:19:54,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-10 12:19:54,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 93. [2018-11-10 12:19:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 12:19:54,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2018-11-10 12:19:54,836 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 64 [2018-11-10 12:19:54,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:54,836 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2018-11-10 12:19:54,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:19:54,836 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2018-11-10 12:19:54,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 12:19:54,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:54,838 INFO L375 BasicCegarLoop]: trace histogram [9, 7, 7, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:54,839 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:54,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2098681456, now seen corresponding path program 1 times [2018-11-10 12:19:54,839 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:54,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:54,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:54,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 23 proven. 29 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-10 12:19:54,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:19:54,917 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/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 12:19:54,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:54,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:19:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 12:19:55,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:19:55,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 13 [2018-11-10 12:19:55,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:19:55,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:19:55,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:19:55,025 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand 13 states. [2018-11-10 12:19:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:55,185 INFO L93 Difference]: Finished difference Result 209 states and 267 transitions. [2018-11-10 12:19:55,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 12:19:55,186 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 107 [2018-11-10 12:19:55,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:55,187 INFO L225 Difference]: With dead ends: 209 [2018-11-10 12:19:55,187 INFO L226 Difference]: Without dead ends: 123 [2018-11-10 12:19:55,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-11-10 12:19:55,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-10 12:19:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2018-11-10 12:19:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-10 12:19:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2018-11-10 12:19:55,198 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 107 [2018-11-10 12:19:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:55,198 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2018-11-10 12:19:55,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:19:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2018-11-10 12:19:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 12:19:55,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:55,199 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:55,200 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:55,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash -553510605, now seen corresponding path program 2 times [2018-11-10 12:19:55,201 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:55,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:55,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:55,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:55,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 21 proven. 17 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-10 12:19:55,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:19:55,259 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/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 12:19:55,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:19:55,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:19:55,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:19:55,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:19:55,323 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 21 proven. 17 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-10 12:19:55,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:19:55,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-11-10 12:19:55,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:19:55,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:19:55,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:19:55,340 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand 10 states. [2018-11-10 12:19:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:55,387 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2018-11-10 12:19:55,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:19:55,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-11-10 12:19:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:55,390 INFO L225 Difference]: With dead ends: 119 [2018-11-10 12:19:55,390 INFO L226 Difference]: Without dead ends: 118 [2018-11-10 12:19:55,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:19:55,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-10 12:19:55,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2018-11-10 12:19:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-10 12:19:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2018-11-10 12:19:55,398 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 129 transitions. Word has length 99 [2018-11-10 12:19:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:55,399 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 129 transitions. [2018-11-10 12:19:55,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:19:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2018-11-10 12:19:55,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 12:19:55,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:55,400 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:55,401 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:55,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:55,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1175143142, now seen corresponding path program 1 times [2018-11-10 12:19:55,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:55,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:55,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:55,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:19:55,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 67 proven. 88 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-11-10 12:19:55,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:19:55,499 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/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 12:19:55,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:55,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:19:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 67 proven. 88 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-11-10 12:19:55,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:19:55,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-10 12:19:55,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:19:55,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:19:55,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:19:55,596 INFO L87 Difference]: Start difference. First operand 112 states and 129 transitions. Second operand 10 states. [2018-11-10 12:19:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:55,755 INFO L93 Difference]: Finished difference Result 248 states and 307 transitions. [2018-11-10 12:19:55,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:19:55,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 137 [2018-11-10 12:19:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:55,758 INFO L225 Difference]: With dead ends: 248 [2018-11-10 12:19:55,758 INFO L226 Difference]: Without dead ends: 143 [2018-11-10 12:19:55,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-11-10 12:19:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-10 12:19:55,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129. [2018-11-10 12:19:55,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-10 12:19:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 155 transitions. [2018-11-10 12:19:55,767 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 155 transitions. Word has length 137 [2018-11-10 12:19:55,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:55,767 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 155 transitions. [2018-11-10 12:19:55,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:19:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 155 transitions. [2018-11-10 12:19:55,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-10 12:19:55,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:55,769 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 14, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:55,769 INFO L424 AbstractCegarLoop]: === Iteration 15 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:55,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:55,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1268644406, now seen corresponding path program 2 times [2018-11-10 12:19:55,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:55,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:55,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:55,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:55,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 266 proven. 191 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2018-11-10 12:19:55,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:19:55,989 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/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 12:19:55,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:19:56,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:19:56,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:19:56,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:19:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 8 proven. 358 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2018-11-10 12:19:56,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:19:56,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 20 [2018-11-10 12:19:56,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 12:19:56,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 12:19:56,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-11-10 12:19:56,304 INFO L87 Difference]: Start difference. First operand 129 states and 155 transitions. Second operand 20 states. [2018-11-10 12:19:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:56,993 INFO L93 Difference]: Finished difference Result 309 states and 425 transitions. [2018-11-10 12:19:56,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-10 12:19:56,993 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 233 [2018-11-10 12:19:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:56,995 INFO L225 Difference]: With dead ends: 309 [2018-11-10 12:19:56,995 INFO L226 Difference]: Without dead ends: 181 [2018-11-10 12:19:56,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2018-11-10 12:19:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-10 12:19:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2018-11-10 12:19:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-10 12:19:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 197 transitions. [2018-11-10 12:19:57,004 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 197 transitions. Word has length 233 [2018-11-10 12:19:57,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:57,005 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 197 transitions. [2018-11-10 12:19:57,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 12:19:57,005 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 197 transitions. [2018-11-10 12:19:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 12:19:57,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:57,007 INFO L375 BasicCegarLoop]: trace histogram [14, 12, 10, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:57,007 INFO L424 AbstractCegarLoop]: === Iteration 16 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:57,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:57,008 INFO L82 PathProgramCache]: Analyzing trace with hash -360339275, now seen corresponding path program 1 times [2018-11-10 12:19:57,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:57,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:57,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:19:57,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 128 proven. 96 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-10 12:19:57,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:19:57,111 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/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 12:19:57,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:57,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:19:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 182 proven. 115 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-11-10 12:19:57,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:19:57,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 13 [2018-11-10 12:19:57,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:19:57,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:19:57,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:19:57,220 INFO L87 Difference]: Start difference. First operand 160 states and 197 transitions. Second operand 13 states. [2018-11-10 12:19:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:57,441 INFO L93 Difference]: Finished difference Result 312 states and 403 transitions. [2018-11-10 12:19:57,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 12:19:57,442 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 177 [2018-11-10 12:19:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:57,443 INFO L225 Difference]: With dead ends: 312 [2018-11-10 12:19:57,443 INFO L226 Difference]: Without dead ends: 163 [2018-11-10 12:19:57,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-11-10 12:19:57,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-10 12:19:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2018-11-10 12:19:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 12:19:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 189 transitions. [2018-11-10 12:19:57,454 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 189 transitions. Word has length 177 [2018-11-10 12:19:57,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:57,454 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 189 transitions. [2018-11-10 12:19:57,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:19:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 189 transitions. [2018-11-10 12:19:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 12:19:57,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:57,457 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 11, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:57,458 INFO L424 AbstractCegarLoop]: === Iteration 17 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:57,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:57,458 INFO L82 PathProgramCache]: Analyzing trace with hash -883454388, now seen corresponding path program 1 times [2018-11-10 12:19:57,458 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:57,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:57,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:57,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:57,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 208 proven. 6 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2018-11-10 12:19:57,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:19:57,558 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/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 12:19:57,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:57,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:19:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 6 proven. 196 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-10 12:19:57,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:19:57,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-11-10 12:19:57,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:19:57,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:19:57,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:19:57,686 INFO L87 Difference]: Start difference. First operand 157 states and 189 transitions. Second operand 13 states. [2018-11-10 12:19:57,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:57,722 INFO L93 Difference]: Finished difference Result 157 states and 189 transitions. [2018-11-10 12:19:57,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:19:57,722 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 190 [2018-11-10 12:19:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:57,724 INFO L225 Difference]: With dead ends: 157 [2018-11-10 12:19:57,724 INFO L226 Difference]: Without dead ends: 148 [2018-11-10 12:19:57,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:19:57,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-10 12:19:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-11-10 12:19:57,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-10 12:19:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2018-11-10 12:19:57,733 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 190 [2018-11-10 12:19:57,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:57,733 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2018-11-10 12:19:57,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:19:57,733 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2018-11-10 12:19:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 12:19:57,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:19:57,735 INFO L375 BasicCegarLoop]: trace histogram [16, 14, 11, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:19:57,736 INFO L424 AbstractCegarLoop]: === Iteration 18 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:19:57,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:19:57,736 INFO L82 PathProgramCache]: Analyzing trace with hash 803401173, now seen corresponding path program 1 times [2018-11-10 12:19:57,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:19:57,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:19:57,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:57,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:57,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:19:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 14 proven. 111 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-10 12:19:57,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:19:57,803 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/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 12:19:57,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:19:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:19:57,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:19:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 14 proven. 132 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2018-11-10 12:19:57,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:19:57,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2018-11-10 12:19:57,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 12:19:57,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 12:19:57,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:19:57,935 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand 14 states. [2018-11-10 12:19:58,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:19:58,042 INFO L93 Difference]: Finished difference Result 239 states and 281 transitions. [2018-11-10 12:19:58,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 12:19:58,043 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 202 [2018-11-10 12:19:58,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:19:58,044 INFO L225 Difference]: With dead ends: 239 [2018-11-10 12:19:58,044 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 12:19:58,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-11-10 12:19:58,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 12:19:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 12:19:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 12:19:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:19:58,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 202 [2018-11-10 12:19:58,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:19:58,045 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:19:58,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 12:19:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:19:58,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 12:19:58,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 12:19:58,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:19:58,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:19:58,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:19:58,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:19:58,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:19:58,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:19:58,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:19:58,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:19:58,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:19:58,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:19:58,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:19:58,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:19:58,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:19:58,420 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 20 [2018-11-10 12:19:58,639 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 19 [2018-11-10 12:19:58,642 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 12:19:58,642 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:19:58,642 INFO L425 ceAbstractionStarter]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 12:19:58,642 INFO L425 ceAbstractionStarter]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 12:19:58,642 INFO L425 ceAbstractionStarter]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2018-11-10 12:19:58,642 INFO L421 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (and (or (<= 1 f_~x) (< 2 |f_#in~x|)) (or (and (<= f_~x |f_#in~x|) (<= |f_#in~x| f_~x)) (< 2147483645 |f_#in~x|))) [2018-11-10 12:19:58,642 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-11-10 12:19:58,642 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-10 12:19:58,642 INFO L425 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2018-11-10 12:19:58,643 INFO L425 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-10 12:19:58,643 INFO L421 ceAbstractionStarter]: At program point L14-4(line 14) the Hoare annotation is: (and (or (<= 1 f_~x) (< 2 |f_#in~x|)) (or (and (<= |f_#t~ret0| 0) (<= f_~x |f_#in~x|) (<= 0 |f_#t~ret0|) (<= |f_#in~x| f_~x)) (< 2147483645 |f_#in~x|))) [2018-11-10 12:19:58,643 INFO L425 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-10 12:19:58,643 INFO L425 ceAbstractionStarter]: For program point L14-6(line 14) no Hoare annotation was computed. [2018-11-10 12:19:58,643 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2018-11-10 12:19:58,643 INFO L425 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-10 12:19:58,643 INFO L428 ceAbstractionStarter]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2018-11-10 12:19:58,643 INFO L425 ceAbstractionStarter]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 12:19:58,643 INFO L425 ceAbstractionStarter]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 12:19:58,643 INFO L425 ceAbstractionStarter]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 12:19:58,643 INFO L425 ceAbstractionStarter]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 12:19:58,643 INFO L425 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 12:19:58,643 INFO L425 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 12:19:58,643 INFO L425 ceAbstractionStarter]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2018-11-10 12:19:58,644 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-10 12:19:58,644 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. [2018-11-10 12:19:58,644 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-10 12:19:58,644 INFO L421 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (and (or (< 3 |g_#in~x|) (<= 1 g_~x)) (or (and (<= g_~x |g_#in~x|) (<= |g_#in~x| g_~x)) (< 2147483647 |g_#in~x|))) [2018-11-10 12:19:58,644 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-10 12:19:58,644 INFO L425 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2018-11-10 12:19:58,644 INFO L425 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-10 12:19:58,644 INFO L421 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (and (or (<= 1 g_~x) (<= 3 |g_#in~x|)) (or (and (<= g_~x |g_#in~x|) (<= 0 |g_#t~ret2|) (<= |g_#in~x| g_~x) (<= |g_#t~ret2| 0)) (< 2147483647 |g_#in~x|))) [2018-11-10 12:19:58,644 INFO L425 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-10 12:19:58,644 INFO L425 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2018-11-10 12:19:58,644 INFO L425 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2018-11-10 12:19:58,644 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2018-11-10 12:19:58,644 INFO L425 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 12:19:58,644 INFO L428 ceAbstractionStarter]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2018-11-10 12:19:58,645 INFO L425 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 12:19:58,645 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:19:58,645 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 12:19:58,645 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 12:19:58,645 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:19:58,645 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 24 27) the Hoare annotation is: true [2018-11-10 12:19:58,645 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 24 27) no Hoare annotation was computed. [2018-11-10 12:19:58,645 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-11-10 12:19:58,645 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-10 12:19:58,645 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 24 27) no Hoare annotation was computed. [2018-11-10 12:19:58,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:19:58 BoogieIcfgContainer [2018-11-10 12:19:58,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:19:58,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:19:58,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:19:58,648 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:19:58,649 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:19:53" (3/4) ... [2018-11-10 12:19:58,652 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:19:58,658 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:19:58,659 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2018-11-10 12:19:58,659 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2018-11-10 12:19:58,659 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:19:58,663 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 12:19:58,663 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 12:19:58,663 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 12:19:58,693 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_632b6254-2403-4160-ae0f-ed7d6b943b74/bin-2019/uautomizer/witness.graphml [2018-11-10 12:19:58,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:19:58,694 INFO L168 Benchmark]: Toolchain (without parser) took 5724.40 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 360.2 MB). Free memory was 960.2 MB in the beginning and 1.3 GB in the end (delta: -377.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:19:58,694 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:19:58,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.74 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:19:58,695 INFO L168 Benchmark]: Boogie Preprocessor took 17.18 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:19:58,695 INFO L168 Benchmark]: RCFGBuilder took 205.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 948.4 MB in the beginning and 1.2 GB in the end (delta: -210.5 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:19:58,695 INFO L168 Benchmark]: TraceAbstraction took 5302.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -182.7 MB). Peak memory consumption was 431.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:19:58,696 INFO L168 Benchmark]: Witness Printer took 45.21 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 895.8 kB). Peak memory consumption was 895.8 kB. Max. memory is 11.5 GB. [2018-11-10 12:19:58,697 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 150.74 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.18 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 205.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 948.4 MB in the beginning and 1.2 GB in the end (delta: -210.5 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5302.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -182.7 MB). Peak memory consumption was 431.2 MB. Max. memory is 11.5 GB. * Witness Printer took 45.21 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 895.8 kB). Peak memory consumption was 895.8 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 47 locations, 10 error locations. SAFE Result, 5.2s OverallTime, 18 OverallIterations, 18 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 611 SDtfs, 746 SDslu, 2496 SDs, 0 SdLazy, 2370 SolverSat, 264 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1406 GetRequests, 1222 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 145 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 302 PreInvPairs, 371 NumberOfFragments, 104 HoareAnnotationTreeSize, 302 FomulaSimplifications, 4191 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 2482 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2668 NumberOfCodeBlocks, 2668 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2642 ConstructedInterpolants, 0 QuantifiedInterpolants, 671208 SizeOfPredicates, 20 NumberOfNonLiveVariables, 2373 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 26 InterpolantComputations, 10 PerfectInterpolantSequences, 6828/8321 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...