./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_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_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/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 cb528549fa76ae8087cf7043645dfa20323a0116 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 08:53:19,793 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:53:19,794 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:53:19,802 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:53:19,802 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:53:19,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:53:19,803 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:53:19,804 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:53:19,805 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:53:19,806 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:53:19,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:53:19,806 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:53:19,807 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:53:19,808 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:53:19,808 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:53:19,809 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:53:19,809 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:53:19,811 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:53:19,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:53:19,813 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:53:19,814 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:53:19,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:53:19,816 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:53:19,816 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:53:19,816 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:53:19,817 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:53:19,818 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:53:19,818 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:53:19,819 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:53:19,820 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:53:19,820 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:53:19,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:53:19,820 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:53:19,821 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:53:19,821 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:53:19,822 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:53:19,822 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-10 08:53:19,831 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:53:19,832 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:53:19,832 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 08:53:19,832 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 08:53:19,833 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:53:19,833 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:53:19,833 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 08:53:19,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:53:19,833 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 08:53:19,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:53:19,834 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:53:19,834 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 08:53:19,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 08:53:19,834 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 08:53:19,834 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 08:53:19,834 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:53:19,834 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 08:53:19,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:53:19,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:53:19,835 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 08:53:19,835 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 08:53:19,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:53:19,835 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:53:19,835 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 08:53:19,835 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 08:53:19,835 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 08:53:19,835 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 08:53:19,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 08:53:19,835 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_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/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 -> cb528549fa76ae8087cf7043645dfa20323a0116 [2018-11-10 08:53:19,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:53:19,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:53:19,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:53:19,868 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:53:19,868 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:53:19,868 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 08:53:19,904 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/bin-2019/uautomizer/data/90aa985bf/48b86b9e8bce483787026d7cb977020d/FLAG741c83a6e [2018-11-10 08:53:20,319 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:53:20,320 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 08:53:20,323 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/bin-2019/uautomizer/data/90aa985bf/48b86b9e8bce483787026d7cb977020d/FLAG741c83a6e [2018-11-10 08:53:20,334 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/bin-2019/uautomizer/data/90aa985bf/48b86b9e8bce483787026d7cb977020d [2018-11-10 08:53:20,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:53:20,338 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 08:53:20,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:53:20,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:53:20,341 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:53:20,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:53:20" (1/1) ... [2018-11-10 08:53:20,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc5bc32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:53:20, skipping insertion in model container [2018-11-10 08:53:20,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:53:20" (1/1) ... [2018-11-10 08:53:20,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:53:20,359 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:53:20,456 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:53:20,459 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:53:20,469 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:53:20,478 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:53:20,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:53:20 WrapperNode [2018-11-10 08:53:20,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:53:20,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:53:20,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:53:20,479 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:53:20,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:53:20" (1/1) ... [2018-11-10 08:53:20,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:53:20" (1/1) ... [2018-11-10 08:53:20,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:53:20" (1/1) ... [2018-11-10 08:53:20,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:53:20" (1/1) ... [2018-11-10 08:53:20,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:53:20" (1/1) ... [2018-11-10 08:53:20,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:53:20" (1/1) ... [2018-11-10 08:53:20,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:53:20" (1/1) ... [2018-11-10 08:53:20,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:53:20,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:53:20,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:53:20,495 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:53:20,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:53:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/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 08:53:20,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 08:53:20,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:53:20,564 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-11-10 08:53:20,564 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-11-10 08:53:20,564 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 08:53:20,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 08:53:20,564 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-11-10 08:53:20,565 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-11-10 08:53:20,565 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 08:53:20,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 08:53:20,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:53:20,680 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:53:20,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:53:20 BoogieIcfgContainer [2018-11-10 08:53:20,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:53:20,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 08:53:20,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 08:53:20,684 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 08:53:20,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:53:20" (1/3) ... [2018-11-10 08:53:20,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196ddfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:53:20, skipping insertion in model container [2018-11-10 08:53:20,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:53:20" (2/3) ... [2018-11-10 08:53:20,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196ddfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:53:20, skipping insertion in model container [2018-11-10 08:53:20,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:53:20" (3/3) ... [2018-11-10 08:53:20,687 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 08:53:20,695 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 08:53:20,701 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-10 08:53:20,712 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-10 08:53:20,729 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 08:53:20,730 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 08:53:20,730 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 08:53:20,730 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 08:53:20,730 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:53:20,730 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:53:20,731 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 08:53:20,731 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:53:20,731 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 08:53:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-10 08:53:20,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 08:53:20,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:20,753 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:53:20,755 INFO L424 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:20,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:20,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1147028286, now seen corresponding path program 1 times [2018-11-10 08:53:20,761 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:20,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:20,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:20,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:20,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:20,886 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 08:53:20,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:53:20,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:53:20,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 08:53:20,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:53:20,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:53:20,903 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-11-10 08:53:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:20,986 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-10 08:53:20,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:53:20,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-10 08:53:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:20,994 INFO L225 Difference]: With dead ends: 67 [2018-11-10 08:53:20,995 INFO L226 Difference]: Without dead ends: 59 [2018-11-10 08:53:20,997 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 08:53:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-10 08:53:21,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2018-11-10 08:53:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 08:53:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-10 08:53:21,025 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 9 [2018-11-10 08:53:21,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:21,025 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-10 08:53:21,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 08:53:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-10 08:53:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 08:53:21,026 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:21,026 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:53:21,026 INFO L424 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:21,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:21,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1198138435, now seen corresponding path program 1 times [2018-11-10 08:53:21,026 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:21,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:21,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:21,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:21,050 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 08:53:21,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:53:21,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:53:21,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:53:21,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:53:21,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:53:21,053 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2018-11-10 08:53:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:21,070 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-10 08:53:21,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:53:21,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-10 08:53:21,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:21,072 INFO L225 Difference]: With dead ends: 56 [2018-11-10 08:53:21,073 INFO L226 Difference]: Without dead ends: 55 [2018-11-10 08:53:21,073 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 08:53:21,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-10 08:53:21,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-10 08:53:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 08:53:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-10 08:53:21,083 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 10 [2018-11-10 08:53:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:21,083 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-10 08:53:21,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:53:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-10 08:53:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 08:53:21,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:21,084 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:53:21,084 INFO L424 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:21,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:21,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2126464488, now seen corresponding path program 1 times [2018-11-10 08:53:21,085 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:21,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:21,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:21,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:21,117 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 08:53:21,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:53:21,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:53:21,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 08:53:21,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:53:21,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:53:21,118 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2018-11-10 08:53:21,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:21,215 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-11-10 08:53:21,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:53:21,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-10 08:53:21,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:21,217 INFO L225 Difference]: With dead ends: 77 [2018-11-10 08:53:21,217 INFO L226 Difference]: Without dead ends: 76 [2018-11-10 08:53:21,218 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 08:53:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-10 08:53:21,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-11-10 08:53:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 08:53:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2018-11-10 08:53:21,230 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 14 [2018-11-10 08:53:21,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:21,231 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2018-11-10 08:53:21,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 08:53:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-11-10 08:53:21,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 08:53:21,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:21,231 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:53:21,232 INFO L424 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:21,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:21,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1495889727, now seen corresponding path program 1 times [2018-11-10 08:53:21,232 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:21,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:21,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:21,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:21,248 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 08:53:21,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:53:21,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:53:21,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:53:21,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:53:21,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:53:21,249 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 3 states. [2018-11-10 08:53:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:21,262 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2018-11-10 08:53:21,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:53:21,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-10 08:53:21,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:21,264 INFO L225 Difference]: With dead ends: 73 [2018-11-10 08:53:21,264 INFO L226 Difference]: Without dead ends: 72 [2018-11-10 08:53:21,264 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 08:53:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-10 08:53:21,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-11-10 08:53:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 08:53:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2018-11-10 08:53:21,271 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 15 [2018-11-10 08:53:21,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:21,271 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2018-11-10 08:53:21,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:53:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2018-11-10 08:53:21,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 08:53:21,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:21,272 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:53:21,272 INFO L424 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:21,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:21,272 INFO L82 PathProgramCache]: Analyzing trace with hash -440899931, now seen corresponding path program 1 times [2018-11-10 08:53:21,272 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:21,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:21,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:21,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:21,306 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 08:53:21,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:53:21,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:53:21,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 08:53:21,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:53:21,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:53:21,307 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 5 states. [2018-11-10 08:53:21,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:21,353 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2018-11-10 08:53:21,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:53:21,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-10 08:53:21,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:21,354 INFO L225 Difference]: With dead ends: 70 [2018-11-10 08:53:21,354 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 08:53:21,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:53:21,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 08:53:21,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-10 08:53:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 08:53:21,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2018-11-10 08:53:21,361 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 20 [2018-11-10 08:53:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:21,361 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2018-11-10 08:53:21,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 08:53:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2018-11-10 08:53:21,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 08:53:21,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:21,362 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, 1] [2018-11-10 08:53:21,362 INFO L424 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:21,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:21,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1311878191, now seen corresponding path program 1 times [2018-11-10 08:53:21,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:21,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:21,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:21,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:21,382 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 08:53:21,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:53:21,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:53:21,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:53:21,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:53:21,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:53:21,384 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 3 states. [2018-11-10 08:53:21,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:21,408 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-10 08:53:21,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:53:21,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 08:53:21,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:21,409 INFO L225 Difference]: With dead ends: 67 [2018-11-10 08:53:21,409 INFO L226 Difference]: Without dead ends: 66 [2018-11-10 08:53:21,409 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 08:53:21,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-10 08:53:21,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-10 08:53:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 08:53:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-11-10 08:53:21,416 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 22 [2018-11-10 08:53:21,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:21,416 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2018-11-10 08:53:21,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:53:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-10 08:53:21,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 08:53:21,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:21,417 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, 1, 1] [2018-11-10 08:53:21,417 INFO L424 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:21,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:21,418 INFO L82 PathProgramCache]: Analyzing trace with hash -840361398, now seen corresponding path program 1 times [2018-11-10 08:53:21,418 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:21,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:21,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:21,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:21,433 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 08:53:21,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:53:21,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:53:21,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:53:21,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:53:21,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:53:21,434 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 3 states. [2018-11-10 08:53:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:21,442 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-10 08:53:21,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:53:21,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 08:53:21,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:21,443 INFO L225 Difference]: With dead ends: 66 [2018-11-10 08:53:21,443 INFO L226 Difference]: Without dead ends: 65 [2018-11-10 08:53:21,443 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 08:53:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-10 08:53:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-10 08:53:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-10 08:53:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-11-10 08:53:21,449 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 23 [2018-11-10 08:53:21,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:21,450 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2018-11-10 08:53:21,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:53:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-11-10 08:53:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 08:53:21,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:21,450 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, 1, 1] [2018-11-10 08:53:21,450 INFO L424 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:21,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:21,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2013518212, now seen corresponding path program 1 times [2018-11-10 08:53:21,451 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:21,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:21,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:21,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:21,468 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 08:53:21,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:53:21,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:53:21,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 08:53:21,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:53:21,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:53:21,468 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 4 states. [2018-11-10 08:53:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:21,484 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2018-11-10 08:53:21,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:53:21,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-10 08:53:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:21,485 INFO L225 Difference]: With dead ends: 90 [2018-11-10 08:53:21,485 INFO L226 Difference]: Without dead ends: 89 [2018-11-10 08:53:21,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:53:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-10 08:53:21,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-11-10 08:53:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 08:53:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2018-11-10 08:53:21,495 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 23 [2018-11-10 08:53:21,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:21,495 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2018-11-10 08:53:21,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 08:53:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2018-11-10 08:53:21,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 08:53:21,496 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:21,496 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, 1, 1, 1] [2018-11-10 08:53:21,496 INFO L424 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:21,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:21,496 INFO L82 PathProgramCache]: Analyzing trace with hash -281399491, now seen corresponding path program 1 times [2018-11-10 08:53:21,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:21,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:21,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:21,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:21,509 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 08:53:21,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:53:21,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:53:21,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 08:53:21,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:53:21,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:53:21,510 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand 4 states. [2018-11-10 08:53:21,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:21,532 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-11-10 08:53:21,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:53:21,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-10 08:53:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:21,533 INFO L225 Difference]: With dead ends: 84 [2018-11-10 08:53:21,533 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 08:53:21,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:53:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 08:53:21,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-10 08:53:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-10 08:53:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2018-11-10 08:53:21,541 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 24 [2018-11-10 08:53:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:21,541 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2018-11-10 08:53:21,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 08:53:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2018-11-10 08:53:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 08:53:21,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:21,542 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, 1, 1] [2018-11-10 08:53:21,542 INFO L424 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:21,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:21,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1215449003, now seen corresponding path program 1 times [2018-11-10 08:53:21,542 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:21,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:21,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:21,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:53:21,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:53:21,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:53:21,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 08:53:21,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:53:21,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:53:21,567 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 5 states. [2018-11-10 08:53:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:21,622 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2018-11-10 08:53:21,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:53:21,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-10 08:53:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:21,623 INFO L225 Difference]: With dead ends: 105 [2018-11-10 08:53:21,623 INFO L226 Difference]: Without dead ends: 104 [2018-11-10 08:53:21,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:53:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-10 08:53:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-11-10 08:53:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 08:53:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2018-11-10 08:53:21,632 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 27 [2018-11-10 08:53:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:21,632 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2018-11-10 08:53:21,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 08:53:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2018-11-10 08:53:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 08:53:21,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:21,634 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 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 08:53:21,634 INFO L424 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:21,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:21,634 INFO L82 PathProgramCache]: Analyzing trace with hash 505515198, now seen corresponding path program 1 times [2018-11-10 08:53:21,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:21,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:21,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:21,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 08:53:21,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:53:21,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:53:21,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 08:53:21,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:53:21,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:53:21,665 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand 5 states. [2018-11-10 08:53:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:21,734 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2018-11-10 08:53:21,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:53:21,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-10 08:53:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:21,737 INFO L225 Difference]: With dead ends: 104 [2018-11-10 08:53:21,737 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 08:53:21,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:53:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 08:53:21,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-11-10 08:53:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-10 08:53:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2018-11-10 08:53:21,750 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 38 [2018-11-10 08:53:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:21,750 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2018-11-10 08:53:21,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 08:53:21,751 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2018-11-10 08:53:21,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 08:53:21,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:21,752 INFO L375 BasicCegarLoop]: trace histogram [5, 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 08:53:21,752 INFO L424 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:21,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:21,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1647590023, now seen corresponding path program 1 times [2018-11-10 08:53:21,753 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:21,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:21,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:21,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 08:53:21,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:53:21,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:53:21,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 08:53:21,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:53:21,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:53:21,788 INFO L87 Difference]: Start difference. First operand 100 states and 127 transitions. Second operand 4 states. [2018-11-10 08:53:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:21,805 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-11-10 08:53:21,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:53:21,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-10 08:53:21,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:21,807 INFO L225 Difference]: With dead ends: 110 [2018-11-10 08:53:21,807 INFO L226 Difference]: Without dead ends: 109 [2018-11-10 08:53:21,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:53:21,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-10 08:53:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-11-10 08:53:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-10 08:53:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2018-11-10 08:53:21,817 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 41 [2018-11-10 08:53:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:21,817 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2018-11-10 08:53:21,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 08:53:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2018-11-10 08:53:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 08:53:21,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:21,819 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 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, 1, 1, 1] [2018-11-10 08:53:21,819 INFO L424 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:21,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:21,820 INFO L82 PathProgramCache]: Analyzing trace with hash -204013767, now seen corresponding path program 1 times [2018-11-10 08:53:21,820 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:21,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:21,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:21,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 08:53:21,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:53:21,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:53:21,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:53:21,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:53:21,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:53:21,857 INFO L87 Difference]: Start difference. First operand 106 states and 133 transitions. Second operand 3 states. [2018-11-10 08:53:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:21,876 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2018-11-10 08:53:21,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:53:21,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-10 08:53:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:21,877 INFO L225 Difference]: With dead ends: 106 [2018-11-10 08:53:21,877 INFO L226 Difference]: Without dead ends: 105 [2018-11-10 08:53:21,878 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 08:53:21,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-10 08:53:21,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-10 08:53:21,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 08:53:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2018-11-10 08:53:21,885 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 48 [2018-11-10 08:53:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:21,886 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2018-11-10 08:53:21,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:53:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2018-11-10 08:53:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 08:53:21,888 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:21,888 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:53:21,889 INFO L424 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:21,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1915961670, now seen corresponding path program 1 times [2018-11-10 08:53:21,889 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:21,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:21,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:21,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:53:21,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:53:21,942 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/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 08:53:21,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:21,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:53:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:53:22,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:53:22,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 08:53:22,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:53:22,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:53:22,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:53:22,025 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand 6 states. [2018-11-10 08:53:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:22,078 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2018-11-10 08:53:22,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:53:22,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-10 08:53:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:22,080 INFO L225 Difference]: With dead ends: 121 [2018-11-10 08:53:22,080 INFO L226 Difference]: Without dead ends: 112 [2018-11-10 08:53:22,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:53:22,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-10 08:53:22,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-11-10 08:53:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-10 08:53:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2018-11-10 08:53:22,090 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 40 [2018-11-10 08:53:22,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:22,090 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2018-11-10 08:53:22,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:53:22,090 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2018-11-10 08:53:22,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 08:53:22,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:22,091 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 2, 2, 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, 1, 1, 1] [2018-11-10 08:53:22,092 INFO L424 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:22,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:22,095 INFO L82 PathProgramCache]: Analyzing trace with hash 541352037, now seen corresponding path program 1 times [2018-11-10 08:53:22,095 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:22,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:22,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:22,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:22,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 08:53:22,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:53:22,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:53:22,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 08:53:22,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:53:22,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:53:22,162 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand 5 states. [2018-11-10 08:53:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:22,199 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2018-11-10 08:53:22,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:53:22,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-10 08:53:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:22,201 INFO L225 Difference]: With dead ends: 109 [2018-11-10 08:53:22,201 INFO L226 Difference]: Without dead ends: 108 [2018-11-10 08:53:22,202 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 08:53:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-10 08:53:22,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2018-11-10 08:53:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-10 08:53:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2018-11-10 08:53:22,210 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 58 [2018-11-10 08:53:22,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:22,210 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2018-11-10 08:53:22,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 08:53:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2018-11-10 08:53:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 08:53:22,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:22,212 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2018-11-10 08:53:22,212 INFO L424 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:22,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:22,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1920964512, now seen corresponding path program 1 times [2018-11-10 08:53:22,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:22,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:22,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 19 proven. 32 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-10 08:53:22,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:53:22,267 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/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 08:53:22,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:22,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:53:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-10 08:53:22,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:53:22,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-10 08:53:22,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:53:22,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:53:22,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:53:22,343 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 6 states. [2018-11-10 08:53:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:22,388 INFO L93 Difference]: Finished difference Result 185 states and 227 transitions. [2018-11-10 08:53:22,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:53:22,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2018-11-10 08:53:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:22,390 INFO L225 Difference]: With dead ends: 185 [2018-11-10 08:53:22,391 INFO L226 Difference]: Without dead ends: 104 [2018-11-10 08:53:22,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:53:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-10 08:53:22,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2018-11-10 08:53:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 08:53:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2018-11-10 08:53:22,404 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 86 [2018-11-10 08:53:22,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:22,404 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2018-11-10 08:53:22,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:53:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2018-11-10 08:53:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 08:53:22,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:22,406 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 5, 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] [2018-11-10 08:53:22,406 INFO L424 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:22,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:22,406 INFO L82 PathProgramCache]: Analyzing trace with hash 471617921, now seen corresponding path program 1 times [2018-11-10 08:53:22,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:22,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:22,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:22,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:22,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-10 08:53:22,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:53:22,448 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/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 08:53:22,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:22,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:53:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-10 08:53:22,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:53:22,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 08:53:22,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:53:22,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:53:22,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:53:22,507 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand 6 states. [2018-11-10 08:53:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:22,575 INFO L93 Difference]: Finished difference Result 204 states and 266 transitions. [2018-11-10 08:53:22,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:53:22,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-10 08:53:22,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:22,577 INFO L225 Difference]: With dead ends: 204 [2018-11-10 08:53:22,577 INFO L226 Difference]: Without dead ends: 116 [2018-11-10 08:53:22,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:53:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-10 08:53:22,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2018-11-10 08:53:22,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-10 08:53:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 132 transitions. [2018-11-10 08:53:22,587 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 132 transitions. Word has length 65 [2018-11-10 08:53:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:22,587 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 132 transitions. [2018-11-10 08:53:22,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:53:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 132 transitions. [2018-11-10 08:53:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 08:53:22,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:22,589 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:53:22,590 INFO L424 AbstractCegarLoop]: === Iteration 18 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:22,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:22,590 INFO L82 PathProgramCache]: Analyzing trace with hash 77369472, now seen corresponding path program 2 times [2018-11-10 08:53:22,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:22,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:22,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:22,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:22,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 08:53:22,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:53:22,636 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/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 08:53:22,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 08:53:22,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 08:53:22,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:53:22,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:53:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 08:53:22,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:53:22,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-10 08:53:22,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:53:22,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:53:22,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:53:22,706 INFO L87 Difference]: Start difference. First operand 107 states and 132 transitions. Second operand 6 states. [2018-11-10 08:53:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:22,733 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2018-11-10 08:53:22,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:53:22,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-10 08:53:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:22,735 INFO L225 Difference]: With dead ends: 116 [2018-11-10 08:53:22,735 INFO L226 Difference]: Without dead ends: 112 [2018-11-10 08:53:22,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:53:22,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-10 08:53:22,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-10 08:53:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-10 08:53:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 137 transitions. [2018-11-10 08:53:22,742 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 137 transitions. Word has length 64 [2018-11-10 08:53:22,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:22,743 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 137 transitions. [2018-11-10 08:53:22,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:53:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2018-11-10 08:53:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 08:53:22,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:22,745 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:53:22,745 INFO L424 AbstractCegarLoop]: === Iteration 19 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:22,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash 695893552, now seen corresponding path program 1 times [2018-11-10 08:53:22,745 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:22,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:22,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:22,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:53:22,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 59 proven. 86 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2018-11-10 08:53:22,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:53:22,817 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/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 08:53:22,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:22,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:53:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 284 proven. 2 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2018-11-10 08:53:22,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:53:22,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 13 [2018-11-10 08:53:22,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 08:53:22,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 08:53:22,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-10 08:53:22,982 INFO L87 Difference]: Start difference. First operand 112 states and 137 transitions. Second operand 13 states. [2018-11-10 08:53:23,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:23,234 INFO L93 Difference]: Finished difference Result 281 states and 368 transitions. [2018-11-10 08:53:23,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 08:53:23,235 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 143 [2018-11-10 08:53:23,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:23,236 INFO L225 Difference]: With dead ends: 281 [2018-11-10 08:53:23,236 INFO L226 Difference]: Without dead ends: 178 [2018-11-10 08:53:23,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-11-10 08:53:23,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-10 08:53:23,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 151. [2018-11-10 08:53:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 08:53:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 181 transitions. [2018-11-10 08:53:23,249 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 181 transitions. Word has length 143 [2018-11-10 08:53:23,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:23,250 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 181 transitions. [2018-11-10 08:53:23,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 08:53:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 181 transitions. [2018-11-10 08:53:23,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 08:53:23,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:23,251 INFO L375 BasicCegarLoop]: trace histogram [17, 15, 11, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:53:23,254 INFO L424 AbstractCegarLoop]: === Iteration 20 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:53:23,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:23,254 INFO L82 PathProgramCache]: Analyzing trace with hash 553509947, now seen corresponding path program 2 times [2018-11-10 08:53:23,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:53:23,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:53:23,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:23,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:23,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 55 proven. 119 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2018-11-10 08:53:23,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:53:23,315 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/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 08:53:23,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 08:53:23,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 08:53:23,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:53:23,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:53:23,391 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 371 proven. 28 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-11-10 08:53:23,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:53:23,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 08:53:23,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 08:53:23,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 08:53:23,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:53:23,418 INFO L87 Difference]: Start difference. First operand 151 states and 181 transitions. Second operand 8 states. [2018-11-10 08:53:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:23,505 INFO L93 Difference]: Finished difference Result 221 states and 272 transitions. [2018-11-10 08:53:23,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:53:23,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 137 [2018-11-10 08:53:23,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:23,506 INFO L225 Difference]: With dead ends: 221 [2018-11-10 08:53:23,507 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 08:53:23,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-10 08:53:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 08:53:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 08:53:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 08:53:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 08:53:23,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 137 [2018-11-10 08:53:23,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:23,508 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:53:23,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 08:53:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 08:53:23,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 08:53:23,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 08:53:23,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:53:23,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:53:23,823 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 08:53:23,823 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 08:53:23,823 INFO L425 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-11-10 08:53:23,823 INFO L425 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-11-10 08:53:23,823 INFO L425 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 08:53:23,823 INFO L425 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 08:53:23,824 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-10 08:53:23,824 INFO L428 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-11-10 08:53:23,824 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-10 08:53:23,824 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-10 08:53:23,824 INFO L421 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (or (< 2147483647 |rec1_#in~i|) (and (<= rec1_~i |rec1_#in~i|) (<= 1 rec1_~i))) [2018-11-10 08:53:23,824 INFO L425 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-10 08:53:23,824 INFO L425 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 08:53:23,824 INFO L425 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 08:53:23,824 INFO L425 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-11-10 08:53:23,824 INFO L425 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-10 08:53:23,824 INFO L421 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (and (or (<= rec1_~i |rec1_#in~i|) (< 2147483646 |rec1_#in~i|)) (or (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (<= rec1_~i 2147483647) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|))) [2018-11-10 08:53:23,824 INFO L425 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-10 08:53:23,825 INFO L421 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (or (< 2147483647 |rec1_#in~i|) (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (<= rec1_~i |rec1_#in~i|) (<= |rec1_#t~ret1| 0) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i))) [2018-11-10 08:53:23,825 INFO L425 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 08:53:23,825 INFO L425 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 08:53:23,825 INFO L425 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-11-10 08:53:23,825 INFO L425 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-11-10 08:53:23,825 INFO L425 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-11-10 08:53:23,825 INFO L425 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 08:53:23,825 INFO L425 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 08:53:23,825 INFO L425 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-11-10 08:53:23,825 INFO L425 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-11-10 08:53:23,825 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-10 08:53:23,825 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-10 08:53:23,826 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-10 08:53:23,826 INFO L421 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (and (<= rec2_~j |rec2_#in~j|) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) [2018-11-10 08:53:23,826 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-10 08:53:23,826 INFO L421 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (or (< 1 |rec2_#in~j|) (<= |rec2_#t~ret3| 0)) (or (and (<= rec2_~j |rec2_#in~j|) (<= |rec2_#t~ret3| 1) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|))) [2018-11-10 08:53:23,826 INFO L425 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-10 08:53:23,826 INFO L425 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-11-10 08:53:23,826 INFO L425 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-10 08:53:23,826 INFO L428 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-11-10 08:53:23,826 INFO L425 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 08:53:23,826 INFO L425 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 08:53:23,826 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 08:53:23,826 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 08:53:23,827 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 08:53:23,827 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 08:53:23,827 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-11-10 08:53:23,827 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-11-10 08:53:23,827 INFO L421 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-11-10 08:53:23,827 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-11-10 08:53:23,827 INFO L425 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-10 08:53:23,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:53:23 BoogieIcfgContainer [2018-11-10 08:53:23,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 08:53:23,831 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:53:23,831 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:53:23,831 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:53:23,831 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:53:20" (3/4) ... [2018-11-10 08:53:23,835 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 08:53:23,841 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 08:53:23,841 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-11-10 08:53:23,841 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-11-10 08:53:23,842 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 08:53:23,845 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 08:53:23,846 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 08:53:23,846 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 08:53:23,884 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_53ff9d95-4e4a-475d-bd27-0e1be6603ba3/bin-2019/uautomizer/witness.graphml [2018-11-10 08:53:23,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:53:23,885 INFO L168 Benchmark]: Toolchain (without parser) took 3547.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.0 MB). Free memory was 963.4 MB in the beginning and 1.0 GB in the end (delta: -85.6 MB). Peak memory consumption was 98.4 MB. Max. memory is 11.5 GB. [2018-11-10 08:53:23,886 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:53:23,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.66 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 952.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:53:23,887 INFO L168 Benchmark]: Boogie Preprocessor took 15.67 ms. Allocated memory is still 1.0 GB. Free memory is still 952.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:53:23,887 INFO L168 Benchmark]: RCFGBuilder took 186.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-10 08:53:23,887 INFO L168 Benchmark]: TraceAbstraction took 3148.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 69.6 MB). Peak memory consumption was 116.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:53:23,888 INFO L168 Benchmark]: Witness Printer took 53.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. [2018-11-10 08:53:23,893 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 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.66 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 952.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.67 ms. Allocated memory is still 1.0 GB. Free memory is still 952.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 186.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3148.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 69.6 MB). Peak memory consumption was 116.7 MB. Max. memory is 11.5 GB. * Witness Printer took 53.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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: 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 - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 49 locations, 10 error locations. SAFE Result, 3.1s OverallTime, 20 OverallIterations, 17 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 821 SDtfs, 324 SDslu, 1920 SDs, 0 SdLazy, 820 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 648 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=19, 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, 20 MinimizatonAttempts, 98 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 305 PreInvPairs, 342 NumberOfFragments, 109 HoareAnnotationTreeSize, 305 FomulaSimplifications, 1402 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 349 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1442 NumberOfCodeBlocks, 1442 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1416 ConstructedInterpolants, 0 QuantifiedInterpolants, 164404 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1101 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 26 InterpolantComputations, 15 PerfectInterpolantSequences, 2987/3300 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...