./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/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 0837a1e1d82be1b28ccf3514392f1b01c88a9160 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:11,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:11,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:11,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:11,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:11,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:11,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:11,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:11,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:11,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:11,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:11,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:11,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:11,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:11,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:11,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:11,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:11,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:11,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:11,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:11,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:11,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:11,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:11,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:11,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:11,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:11,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:11,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:11,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:11,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:11,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:11,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:11,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:11,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:11,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:11,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:11,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:11,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:11,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:11,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:11,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:11,299 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-10-22 08:54:11,310 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:11,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:11,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:11,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:11,311 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:11,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:11,312 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:11,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:11,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:11,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:54:11,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:54:11,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:54:11,313 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-10-22 08:54:11,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:11,313 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:11,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:54:11,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:11,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:11,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:54:11,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:54:11,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:54:11,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:11,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:54:11,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:54:11,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:11,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:54:11,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:54:11,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_6b38935a-0541-4765-95d4-62bd8af5053b/bin/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 -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2019-10-22 08:54:11,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:11,351 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:11,354 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:11,356 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:11,356 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:11,357 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-10-22 08:54:11,401 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/uautomizer/data/4f555a7a8/6fe278b3771a4b0ea052946365d00bc8/FLAGc2e14d522 [2019-10-22 08:54:11,781 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:11,782 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-10-22 08:54:11,786 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/uautomizer/data/4f555a7a8/6fe278b3771a4b0ea052946365d00bc8/FLAGc2e14d522 [2019-10-22 08:54:12,210 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/uautomizer/data/4f555a7a8/6fe278b3771a4b0ea052946365d00bc8 [2019-10-22 08:54:12,212 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:12,213 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:12,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:12,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:12,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:12,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d4dd265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,228 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:12,243 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:12,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,371 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:12,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,456 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:12,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12 WrapperNode [2019-10-22 08:54:12,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:12,458 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:12,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:12,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:12,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:12,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:12,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:12,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:12,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/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 [2019-10-22 08:54:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-10-22 08:54:12,577 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-10-22 08:54:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-10-22 08:54:12,577 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-10-22 08:54:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:12,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:12,815 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:12,815 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-22 08:54:12,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12 BoogieIcfgContainer [2019-10-22 08:54:12,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:12,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:54:12,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:54:12,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:54:12,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:54:12" (1/3) ... [2019-10-22 08:54:12,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112eede0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (2/3) ... [2019-10-22 08:54:12,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112eede0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12" (3/3) ... [2019-10-22 08:54:12,828 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d.c [2019-10-22 08:54:12,837 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:54:12,844 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-10-22 08:54:12,855 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-10-22 08:54:12,882 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:54:12,883 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:54:12,883 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:54:12,883 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:12,883 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:12,884 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:54:12,884 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:12,884 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:54:12,905 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-10-22 08:54:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 08:54:12,912 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:12,913 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:12,916 INFO L410 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:12,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:12,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1656652383, now seen corresponding path program 1 times [2019-10-22 08:54:12,932 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:12,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456655293] [2019-10-22 08:54:12,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:13,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456655293] [2019-10-22 08:54:13,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:13,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:13,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44583766] [2019-10-22 08:54:13,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:54:13,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:13,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:13,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:13,141 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 7 states. [2019-10-22 08:54:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:13,430 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-10-22 08:54:13,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:54:13,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-10-22 08:54:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:13,441 INFO L225 Difference]: With dead ends: 86 [2019-10-22 08:54:13,441 INFO L226 Difference]: Without dead ends: 79 [2019-10-22 08:54:13,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:54:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-22 08:54:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2019-10-22 08:54:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 08:54:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-10-22 08:54:13,488 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 8 [2019-10-22 08:54:13,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:13,488 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-10-22 08:54:13,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:54:13,488 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-10-22 08:54:13,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 08:54:13,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:13,490 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,490 INFO L410 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:13,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,491 INFO L82 PathProgramCache]: Analyzing trace with hash -183383641, now seen corresponding path program 1 times [2019-10-22 08:54:13,491 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642915497] [2019-10-22 08:54:13,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:13,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642915497] [2019-10-22 08:54:13,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:13,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:13,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662568054] [2019-10-22 08:54:13,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:13,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:13,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:13,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:13,511 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-10-22 08:54:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:13,549 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2019-10-22 08:54:13,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:13,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-10-22 08:54:13,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:13,553 INFO L225 Difference]: With dead ends: 70 [2019-10-22 08:54:13,554 INFO L226 Difference]: Without dead ends: 69 [2019-10-22 08:54:13,554 INFO L600 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 [2019-10-22 08:54:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-22 08:54:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-10-22 08:54:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-22 08:54:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2019-10-22 08:54:13,570 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 9 [2019-10-22 08:54:13,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:13,570 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2019-10-22 08:54:13,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:13,571 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2019-10-22 08:54:13,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 08:54:13,574 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:13,574 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,574 INFO L410 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:13,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,575 INFO L82 PathProgramCache]: Analyzing trace with hash -138388889, now seen corresponding path program 1 times [2019-10-22 08:54:13,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274797608] [2019-10-22 08:54:13,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:13,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274797608] [2019-10-22 08:54:13,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:13,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:13,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670021020] [2019-10-22 08:54:13,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:13,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:13,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:13,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:13,601 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand 3 states. [2019-10-22 08:54:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:13,613 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-10-22 08:54:13,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:13,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 08:54:13,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:13,615 INFO L225 Difference]: With dead ends: 65 [2019-10-22 08:54:13,615 INFO L226 Difference]: Without dead ends: 64 [2019-10-22 08:54:13,615 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-22 08:54:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-10-22 08:54:13,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-22 08:54:13,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2019-10-22 08:54:13,630 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 11 [2019-10-22 08:54:13,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:13,631 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2019-10-22 08:54:13,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:13,631 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2019-10-22 08:54:13,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 08:54:13,631 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:13,632 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,632 INFO L410 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:13,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,632 INFO L82 PathProgramCache]: Analyzing trace with hash 4911801, now seen corresponding path program 1 times [2019-10-22 08:54:13,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56317206] [2019-10-22 08:54:13,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:13,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56317206] [2019-10-22 08:54:13,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:13,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:13,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518398254] [2019-10-22 08:54:13,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:13,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:13,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:13,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:13,677 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 4 states. [2019-10-22 08:54:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:13,701 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2019-10-22 08:54:13,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:13,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 08:54:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:13,703 INFO L225 Difference]: With dead ends: 85 [2019-10-22 08:54:13,703 INFO L226 Difference]: Without dead ends: 84 [2019-10-22 08:54:13,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-22 08:54:13,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2019-10-22 08:54:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 08:54:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2019-10-22 08:54:13,718 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 12 [2019-10-22 08:54:13,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:13,719 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2019-10-22 08:54:13,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2019-10-22 08:54:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:54:13,719 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:13,719 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,720 INFO L410 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2115393736, now seen corresponding path program 1 times [2019-10-22 08:54:13,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378698069] [2019-10-22 08:54:13,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:13,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378698069] [2019-10-22 08:54:13,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:13,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:13,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941333024] [2019-10-22 08:54:13,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:13,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:13,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:13,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:13,749 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 3 states. [2019-10-22 08:54:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:13,764 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2019-10-22 08:54:13,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:13,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 08:54:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:13,766 INFO L225 Difference]: With dead ends: 74 [2019-10-22 08:54:13,766 INFO L226 Difference]: Without dead ends: 73 [2019-10-22 08:54:13,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-22 08:54:13,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-10-22 08:54:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-22 08:54:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2019-10-22 08:54:13,776 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 16 [2019-10-22 08:54:13,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:13,777 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2019-10-22 08:54:13,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:13,777 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2019-10-22 08:54:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 08:54:13,777 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:13,778 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,778 INFO L410 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:13,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1152696420, now seen corresponding path program 1 times [2019-10-22 08:54:13,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855126957] [2019-10-22 08:54:13,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:13,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855126957] [2019-10-22 08:54:13,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:13,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:13,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722780682] [2019-10-22 08:54:13,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:13,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:13,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:13,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:13,818 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand 4 states. [2019-10-22 08:54:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:13,840 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-10-22 08:54:13,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:13,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-22 08:54:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:13,842 INFO L225 Difference]: With dead ends: 94 [2019-10-22 08:54:13,842 INFO L226 Difference]: Without dead ends: 93 [2019-10-22 08:54:13,842 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-22 08:54:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2019-10-22 08:54:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-22 08:54:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2019-10-22 08:54:13,852 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 17 [2019-10-22 08:54:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:13,853 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2019-10-22 08:54:13,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2019-10-22 08:54:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 08:54:13,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:13,854 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,854 INFO L410 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:13,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1079409517, now seen corresponding path program 1 times [2019-10-22 08:54:13,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964336863] [2019-10-22 08:54:13,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:13,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964336863] [2019-10-22 08:54:13,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815537903] [2019-10-22 08:54:13,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:13,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:14,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:14,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-10-22 08:54:14,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8891988] [2019-10-22 08:54:14,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:54:14,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:14,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:14,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:54:14,047 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 5 states. [2019-10-22 08:54:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:14,107 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2019-10-22 08:54:14,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:14,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-22 08:54:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:14,108 INFO L225 Difference]: With dead ends: 125 [2019-10-22 08:54:14,109 INFO L226 Difference]: Without dead ends: 75 [2019-10-22 08:54:14,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:54:14,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-22 08:54:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-10-22 08:54:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-22 08:54:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2019-10-22 08:54:14,119 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 19 [2019-10-22 08:54:14,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:14,119 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2019-10-22 08:54:14,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:54:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2019-10-22 08:54:14,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:54:14,120 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:14,120 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:14,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:14,321 INFO L410 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:14,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1643853139, now seen corresponding path program 1 times [2019-10-22 08:54:14,322 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210599855] [2019-10-22 08:54:14,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:14,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210599855] [2019-10-22 08:54:14,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:14,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:14,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450830074] [2019-10-22 08:54:14,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:14,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:14,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:14,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:14,408 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 6 states. [2019-10-22 08:54:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:14,487 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2019-10-22 08:54:14,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:14,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-22 08:54:14,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:14,489 INFO L225 Difference]: With dead ends: 149 [2019-10-22 08:54:14,489 INFO L226 Difference]: Without dead ends: 91 [2019-10-22 08:54:14,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:54:14,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-22 08:54:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2019-10-22 08:54:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-22 08:54:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2019-10-22 08:54:14,501 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 21 [2019-10-22 08:54:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:14,501 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2019-10-22 08:54:14,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2019-10-22 08:54:14,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 08:54:14,502 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:14,502 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:14,502 INFO L410 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:14,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,503 INFO L82 PathProgramCache]: Analyzing trace with hash 883505486, now seen corresponding path program 1 times [2019-10-22 08:54:14,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799492030] [2019-10-22 08:54:14,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 08:54:14,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799492030] [2019-10-22 08:54:14,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:14,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:14,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393737717] [2019-10-22 08:54:14,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:14,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:14,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:14,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:14,548 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand 6 states. [2019-10-22 08:54:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:14,604 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2019-10-22 08:54:14,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:14,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-10-22 08:54:14,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:14,606 INFO L225 Difference]: With dead ends: 158 [2019-10-22 08:54:14,606 INFO L226 Difference]: Without dead ends: 95 [2019-10-22 08:54:14,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:54:14,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-22 08:54:14,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2019-10-22 08:54:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-22 08:54:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2019-10-22 08:54:14,628 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 27 [2019-10-22 08:54:14,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:14,628 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2019-10-22 08:54:14,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:14,629 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2019-10-22 08:54:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 08:54:14,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:14,629 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:14,630 INFO L410 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:14,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,630 INFO L82 PathProgramCache]: Analyzing trace with hash 952008726, now seen corresponding path program 1 times [2019-10-22 08:54:14,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062917310] [2019-10-22 08:54:14,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-22 08:54:14,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062917310] [2019-10-22 08:54:14,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:14,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:14,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097104941] [2019-10-22 08:54:14,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:14,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:14,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:14,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:14,690 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 4 states. [2019-10-22 08:54:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:14,713 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2019-10-22 08:54:14,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:14,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-22 08:54:14,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:14,715 INFO L225 Difference]: With dead ends: 94 [2019-10-22 08:54:14,716 INFO L226 Difference]: Without dead ends: 93 [2019-10-22 08:54:14,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:14,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-22 08:54:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-10-22 08:54:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-22 08:54:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2019-10-22 08:54:14,739 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 30 [2019-10-22 08:54:14,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:14,740 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2019-10-22 08:54:14,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:14,740 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2019-10-22 08:54:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:54:14,741 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:14,741 INFO L380 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] [2019-10-22 08:54:14,741 INFO L410 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:14,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1375674171, now seen corresponding path program 1 times [2019-10-22 08:54:14,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564357317] [2019-10-22 08:54:14,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-22 08:54:14,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564357317] [2019-10-22 08:54:14,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:14,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:14,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799269146] [2019-10-22 08:54:14,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:14,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:14,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:14,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:14,770 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand 3 states. [2019-10-22 08:54:14,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:14,780 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2019-10-22 08:54:14,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:14,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 08:54:14,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:14,781 INFO L225 Difference]: With dead ends: 91 [2019-10-22 08:54:14,781 INFO L226 Difference]: Without dead ends: 90 [2019-10-22 08:54:14,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:14,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-22 08:54:14,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-10-22 08:54:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-22 08:54:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-10-22 08:54:14,797 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 36 [2019-10-22 08:54:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:14,797 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-10-22 08:54:14,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-10-22 08:54:14,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:54:14,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:14,798 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-10-22 08:54:14,799 INFO L410 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:14,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,801 INFO L82 PathProgramCache]: Analyzing trace with hash 930510463, now seen corresponding path program 1 times [2019-10-22 08:54:14,801 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894065191] [2019-10-22 08:54:14,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-22 08:54:14,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894065191] [2019-10-22 08:54:14,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:14,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:14,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549653341] [2019-10-22 08:54:14,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:14,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:14,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:14,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:14,893 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 6 states. [2019-10-22 08:54:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:14,928 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2019-10-22 08:54:14,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:14,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-10-22 08:54:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:14,934 INFO L225 Difference]: With dead ends: 90 [2019-10-22 08:54:14,934 INFO L226 Difference]: Without dead ends: 89 [2019-10-22 08:54:14,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-22 08:54:14,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-10-22 08:54:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 08:54:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-10-22 08:54:14,946 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 36 [2019-10-22 08:54:14,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:14,946 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-10-22 08:54:14,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-10-22 08:54:14,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 08:54:14,947 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:14,948 INFO L380 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:14,948 INFO L410 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:14,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1111626321, now seen corresponding path program 1 times [2019-10-22 08:54:14,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670766316] [2019-10-22 08:54:14,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-22 08:54:15,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670766316] [2019-10-22 08:54:15,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:15,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:15,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343764834] [2019-10-22 08:54:15,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:15,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:15,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:15,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:15,043 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-10-22 08:54:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:15,095 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2019-10-22 08:54:15,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:15,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-22 08:54:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:15,096 INFO L225 Difference]: With dead ends: 99 [2019-10-22 08:54:15,097 INFO L226 Difference]: Without dead ends: 98 [2019-10-22 08:54:15,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-22 08:54:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2019-10-22 08:54:15,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-22 08:54:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2019-10-22 08:54:15,109 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 46 [2019-10-22 08:54:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:15,109 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2019-10-22 08:54:15,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2019-10-22 08:54:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 08:54:15,111 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:15,111 INFO L380 BasicCegarLoop]: trace histogram [7, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:15,111 INFO L410 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:15,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:15,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1401145536, now seen corresponding path program 1 times [2019-10-22 08:54:15,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:15,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655927634] [2019-10-22 08:54:15,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-22 08:54:15,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655927634] [2019-10-22 08:54:15,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579873529] [2019-10-22 08:54:15,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:15,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-22 08:54:15,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:15,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-10-22 08:54:15,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910715107] [2019-10-22 08:54:15,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:54:15,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:15,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:15,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:54:15,315 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 7 states. [2019-10-22 08:54:15,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:15,488 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2019-10-22 08:54:15,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:54:15,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-10-22 08:54:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:15,490 INFO L225 Difference]: With dead ends: 116 [2019-10-22 08:54:15,490 INFO L226 Difference]: Without dead ends: 115 [2019-10-22 08:54:15,490 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-10-22 08:54:15,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-22 08:54:15,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-10-22 08:54:15,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-22 08:54:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2019-10-22 08:54:15,502 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 50 [2019-10-22 08:54:15,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:15,502 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2019-10-22 08:54:15,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:54:15,502 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2019-10-22 08:54:15,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 08:54:15,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:15,503 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 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, 1] [2019-10-22 08:54:15,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:15,707 INFO L410 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:15,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:15,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1156205799, now seen corresponding path program 1 times [2019-10-22 08:54:15,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:15,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109869951] [2019-10-22 08:54:15,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-22 08:54:15,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109869951] [2019-10-22 08:54:15,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70519756] [2019-10-22 08:54:15,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:54:15,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-22 08:54:15,851 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:15,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-10-22 08:54:15,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452642881] [2019-10-22 08:54:15,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:54:15,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:15,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:54:15,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:54:15,853 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand 10 states. [2019-10-22 08:54:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:15,947 INFO L93 Difference]: Finished difference Result 224 states and 282 transitions. [2019-10-22 08:54:15,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:54:15,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-10-22 08:54:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:15,948 INFO L225 Difference]: With dead ends: 224 [2019-10-22 08:54:15,948 INFO L226 Difference]: Without dead ends: 145 [2019-10-22 08:54:15,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:54:15,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-22 08:54:15,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2019-10-22 08:54:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-22 08:54:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2019-10-22 08:54:15,958 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 43 [2019-10-22 08:54:15,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:15,958 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2019-10-22 08:54:15,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:54:15,958 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2019-10-22 08:54:15,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 08:54:15,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:15,959 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1] [2019-10-22 08:54:16,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:16,160 INFO L410 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:16,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:16,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1154921966, now seen corresponding path program 1 times [2019-10-22 08:54:16,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:16,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594346781] [2019-10-22 08:54:16,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:54:16,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594346781] [2019-10-22 08:54:16,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:16,186 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:16,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161774985] [2019-10-22 08:54:16,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:16,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:16,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:16,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:16,187 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand 3 states. [2019-10-22 08:54:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:16,196 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2019-10-22 08:54:16,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:16,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-22 08:54:16,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:16,197 INFO L225 Difference]: With dead ends: 132 [2019-10-22 08:54:16,197 INFO L226 Difference]: Without dead ends: 131 [2019-10-22 08:54:16,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-22 08:54:16,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-10-22 08:54:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-22 08:54:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2019-10-22 08:54:16,206 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 43 [2019-10-22 08:54:16,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:16,206 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2019-10-22 08:54:16,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:16,206 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2019-10-22 08:54:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 08:54:16,207 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:16,207 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:16,208 INFO L410 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:16,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842648, now seen corresponding path program 1 times [2019-10-22 08:54:16,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:16,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509226124] [2019-10-22 08:54:16,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:54:16,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509226124] [2019-10-22 08:54:16,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:16,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:16,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215848768] [2019-10-22 08:54:16,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:16,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:16,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:16,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:16,261 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand 4 states. [2019-10-22 08:54:16,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:16,280 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2019-10-22 08:54:16,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:16,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-22 08:54:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:16,281 INFO L225 Difference]: With dead ends: 140 [2019-10-22 08:54:16,281 INFO L226 Difference]: Without dead ends: 132 [2019-10-22 08:54:16,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:16,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-22 08:54:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-10-22 08:54:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-22 08:54:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2019-10-22 08:54:16,292 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 44 [2019-10-22 08:54:16,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:16,292 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2019-10-22 08:54:16,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2019-10-22 08:54:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 08:54:16,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:16,293 INFO L380 BasicCegarLoop]: trace histogram [11, 8, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:16,293 INFO L410 AbstractCegarLoop]: === Iteration 18 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:16,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:16,293 INFO L82 PathProgramCache]: Analyzing trace with hash -920789439, now seen corresponding path program 2 times [2019-10-22 08:54:16,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:16,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059130163] [2019-10-22 08:54:16,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 67 proven. 32 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-22 08:54:16,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059130163] [2019-10-22 08:54:16,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408794356] [2019-10-22 08:54:16,414 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:16,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:54:16,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:54:16,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:54:16,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 71 proven. 28 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-22 08:54:16,492 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:16,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2019-10-22 08:54:16,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986240174] [2019-10-22 08:54:16,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-22 08:54:16,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:16,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 08:54:16,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:54:16,493 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 13 states. [2019-10-22 08:54:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:16,651 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2019-10-22 08:54:16,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:54:16,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2019-10-22 08:54:16,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:16,654 INFO L225 Difference]: With dead ends: 155 [2019-10-22 08:54:16,655 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:54:16,655 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-10-22 08:54:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:54:16,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:54:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:54:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:54:16,656 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2019-10-22 08:54:16,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:16,656 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:16,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-22 08:54:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:16,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:54:16,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:16,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:54:17,210 INFO L443 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-10-22 08:54:17,211 INFO L443 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-10-22 08:54:17,211 INFO L443 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-10-22 08:54:17,211 INFO L443 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-10-22 08:54:17,211 INFO L443 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-10-22 08:54:17,211 INFO L443 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-10-22 08:54:17,211 INFO L443 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-10-22 08:54:17,211 INFO L443 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-10-22 08:54:17,211 INFO L443 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-10-22 08:54:17,211 INFO L446 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-10-22 08:54:17,212 INFO L443 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-10-22 08:54:17,212 INFO L443 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-10-22 08:54:17,212 INFO L439 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (or (not (<= |rec1_#in~i| 2147483647)) (and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))) [2019-10-22 08:54:17,212 INFO L443 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-10-22 08:54:17,212 INFO L443 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-10-22 08:54:17,212 INFO L443 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-10-22 08:54:17,212 INFO L439 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (let ((.cse0 (not (<= |rec1_#in~i| 2147483647)))) (and (or .cse0 (= |rec1_#in~i| rec1_~i)) (or (and (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) .cse0))) [2019-10-22 08:54:17,212 INFO L443 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-10-22 08:54:17,212 INFO L439 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (let ((.cse0 (not (<= |rec1_#in~i| 2147483647)))) (and (or .cse0 (and (<= |rec1_#t~ret1| 0) (<= 1 rec1_~i))) (or (and (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1)) .cse0))) [2019-10-22 08:54:17,212 INFO L443 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-10-22 08:54:17,213 INFO L443 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-10-22 08:54:17,213 INFO L443 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-10-22 08:54:17,213 INFO L443 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-10-22 08:54:17,213 INFO L443 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-10-22 08:54:17,213 INFO L443 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-10-22 08:54:17,213 INFO L443 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-10-22 08:54:17,213 INFO L443 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-10-22 08:54:17,213 INFO L443 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-10-22 08:54:17,214 INFO L439 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-10-22 08:54:17,214 INFO L443 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-10-22 08:54:17,214 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-10-22 08:54:17,214 INFO L443 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2019-10-22 08:54:17,214 INFO L443 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-10-22 08:54:17,214 INFO L439 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= |rec2_#t~ret3| 1) (<= 1 rec2_~j) (<= 1 |rec2_#t~ret3|)) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-10-22 08:54:17,214 INFO L443 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-10-22 08:54:17,214 INFO L443 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-10-22 08:54:17,214 INFO L443 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-10-22 08:54:17,214 INFO L446 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-10-22 08:54:17,215 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:54:17,215 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:54:17,215 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:54:17,215 INFO L439 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-10-22 08:54:17,215 INFO L443 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-10-22 08:54:17,215 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-10-22 08:54:17,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:54:17 BoogieIcfgContainer [2019-10-22 08:54:17,218 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:54:17,218 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:17,218 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:17,219 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:17,219 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12" (3/4) ... [2019-10-22 08:54:17,224 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:54:17,236 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-10-22 08:54:17,236 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-10-22 08:54:17,241 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-10-22 08:54:17,242 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:54:17,310 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6b38935a-0541-4765-95d4-62bd8af5053b/bin/uautomizer/witness.graphml [2019-10-22 08:54:17,311 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:17,313 INFO L168 Benchmark]: Toolchain (without parser) took 5099.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 941.8 MB in the beginning and 1.2 GB in the end (delta: -245.4 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:17,313 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:17,313 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -204.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:17,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:17,314 INFO L168 Benchmark]: Boogie Preprocessor took 16.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:17,314 INFO L168 Benchmark]: RCFGBuilder took 310.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:17,315 INFO L168 Benchmark]: TraceAbstraction took 4400.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.8 MB in the end (delta: 238.2 MB). Peak memory consumption was 238.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:17,315 INFO L168 Benchmark]: Witness Printer took 92.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 42.5 MB). Free memory was 878.8 MB in the beginning and 1.2 GB in the end (delta: -308.4 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:17,320 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -204.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 310.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4400.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.8 MB in the end (delta: 238.2 MB). Peak memory consumption was 238.2 MB. Max. memory is 11.5 GB. * Witness Printer took 92.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 42.5 MB). Free memory was 878.8 MB in the beginning and 1.2 GB in the end (delta: -308.4 MB). Peak memory consumption was 4.8 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 3 procedures, 44 locations, 10 error locations. Result: SAFE, OverallTime: 4.3s, OverallIterations: 18, TraceHistogramMax: 11, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 687 SDtfs, 244 SDslu, 1726 SDs, 0 SdLazy, 619 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 89 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 225 PreInvPairs, 234 NumberOfFragments, 103 HoareAnnotationTreeSize, 225 FomulaSimplifications, 518 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 217 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 740 NumberOfCodeBlocks, 740 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 718 ConstructedInterpolants, 0 QuantifiedInterpolants, 52034 SizeOfPredicates, 6 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 775/843 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...