./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.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/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/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 cb528549fa76ae8087cf7043645dfa20323a0116 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:34:07,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:34:07,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:34:07,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:34:07,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:34:07,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:34:07,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:34:07,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:34:07,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:34:07,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:34:07,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:34:07,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:34:07,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:34:07,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:34:07,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:34:07,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:34:07,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:34:07,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:34:07,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:34:07,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:34:07,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:34:07,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:34:07,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:34:07,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:34:07,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:34:07,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:34:07,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:34:07,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:34:07,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:34:07,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:34:07,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:34:07,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:34:07,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:34:07,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:34:07,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:34:07,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:34:07,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:34:07,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:34:07,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:34:07,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:34:07,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:34:07,373 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-15 22:34:07,386 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:34:07,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:34:07,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:34:07,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:34:07,388 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:34:07,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:34:07,388 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:34:07,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:34:07,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:34:07,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:34:07,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:34:07,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:34:07,390 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-15 22:34:07,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:34:07,390 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:34:07,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:34:07,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:34:07,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:34:07,391 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:34:07,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:34:07,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:34:07,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:34:07,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:34:07,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:34:07,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:34:07,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:34:07,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:34:07,393 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/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/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 -> cb528549fa76ae8087cf7043645dfa20323a0116 [2019-11-15 22:34:07,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:34:07,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:34:07,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:34:07,431 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:34:07,431 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:34:07,432 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-11-15 22:34:07,481 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/bin/uautomizer/data/88356bf38/8df53f0b32074bfaab3b7bc6ea0f44c8/FLAG1c0c4951c [2019-11-15 22:34:07,850 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:34:07,851 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-11-15 22:34:07,856 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/bin/uautomizer/data/88356bf38/8df53f0b32074bfaab3b7bc6ea0f44c8/FLAG1c0c4951c [2019-11-15 22:34:07,879 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/bin/uautomizer/data/88356bf38/8df53f0b32074bfaab3b7bc6ea0f44c8 [2019-11-15 22:34:07,882 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:34:07,883 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:34:07,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:34:07,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:34:07,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:34:07,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:34:07" (1/1) ... [2019-11-15 22:34:07,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b01265d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:07, skipping insertion in model container [2019-11-15 22:34:07,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:34:07" (1/1) ... [2019-11-15 22:34:07,899 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:34:07,915 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:34:08,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:34:08,087 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:34:08,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:34:08,176 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:34:08,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:08 WrapperNode [2019-11-15 22:34:08,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:34:08,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:34:08,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:34:08,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:34:08,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:08" (1/1) ... [2019-11-15 22:34:08,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:08" (1/1) ... [2019-11-15 22:34:08,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:34:08,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:34:08,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:34:08,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:34:08,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:08" (1/1) ... [2019-11-15 22:34:08,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:08" (1/1) ... [2019-11-15 22:34:08,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:08" (1/1) ... [2019-11-15 22:34:08,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:08" (1/1) ... [2019-11-15 22:34:08,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:08" (1/1) ... [2019-11-15 22:34:08,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:08" (1/1) ... [2019-11-15 22:34:08,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:08" (1/1) ... [2019-11-15 22:34:08,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:34:08,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:34:08,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:34:08,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:34:08,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/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-11-15 22:34:08,280 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-11-15 22:34:08,280 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-11-15 22:34:08,280 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-11-15 22:34:08,280 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-11-15 22:34:08,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:34:08,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:34:08,479 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:34:08,479 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 22:34:08,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:34:08 BoogieIcfgContainer [2019-11-15 22:34:08,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:34:08,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:34:08,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:34:08,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:34:08,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:34:07" (1/3) ... [2019-11-15 22:34:08,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17abf34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:34:08, skipping insertion in model container [2019-11-15 22:34:08,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:08" (2/3) ... [2019-11-15 22:34:08,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17abf34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:34:08, skipping insertion in model container [2019-11-15 22:34:08,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:34:08" (3/3) ... [2019-11-15 22:34:08,487 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b.c [2019-11-15 22:34:08,495 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:34:08,500 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-15 22:34:08,509 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-15 22:34:08,529 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:34:08,529 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:34:08,529 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:34:08,530 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:34:08,530 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:34:08,530 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:34:08,530 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:34:08,530 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:34:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-11-15 22:34:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-15 22:34:08,556 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:08,557 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-15 22:34:08,559 INFO L410 AbstractCegarLoop]: === Iteration 1 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:08,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:08,565 INFO L82 PathProgramCache]: Analyzing trace with hash 70122184, now seen corresponding path program 1 times [2019-11-15 22:34:08,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:08,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416311168] [2019-11-15 22:34:08,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:08,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:08,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:34:08,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416311168] [2019-11-15 22:34:08,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:08,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:34:08,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288809189] [2019-11-15 22:34:08,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:34:08,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:08,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:34:08,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:08,711 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2019-11-15 22:34:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:08,835 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-11-15 22:34:08,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:34:08,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-11-15 22:34:08,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:08,846 INFO L225 Difference]: With dead ends: 62 [2019-11-15 22:34:08,846 INFO L226 Difference]: Without dead ends: 55 [2019-11-15 22:34:08,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:34:08,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-15 22:34:08,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2019-11-15 22:34:08,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 22:34:08,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-11-15 22:34:08,895 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-11-15 22:34:08,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:08,895 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-11-15 22:34:08,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:34:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-11-15 22:34:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-15 22:34:08,896 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:08,896 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:34:08,897 INFO L410 AbstractCegarLoop]: === Iteration 2 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:08,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:08,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2121179530, now seen corresponding path program 1 times [2019-11-15 22:34:08,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:08,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084230398] [2019-11-15 22:34:08,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:08,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:08,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:34:08,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084230398] [2019-11-15 22:34:08,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:08,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:34:08,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915669023] [2019-11-15 22:34:08,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:34:08,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:08,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:34:08,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:34:08,921 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-11-15 22:34:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:08,940 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-11-15 22:34:08,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:34:08,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-15 22:34:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:08,943 INFO L225 Difference]: With dead ends: 52 [2019-11-15 22:34:08,945 INFO L226 Difference]: Without dead ends: 51 [2019-11-15 22:34:08,946 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-11-15 22:34:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-15 22:34:08,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-11-15 22:34:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-15 22:34:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-11-15 22:34:08,964 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 6 [2019-11-15 22:34:08,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:08,965 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-11-15 22:34:08,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:34:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-11-15 22:34:08,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:34:08,965 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:08,966 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:08,966 INFO L410 AbstractCegarLoop]: === Iteration 3 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:08,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:08,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2074588191, now seen corresponding path program 1 times [2019-11-15 22:34:08,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:08,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942831015] [2019-11-15 22:34:08,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:08,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:08,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:34:09,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942831015] [2019-11-15 22:34:09,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:09,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:34:09,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616054687] [2019-11-15 22:34:09,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:34:09,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:09,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:34:09,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:34:09,029 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 7 states. [2019-11-15 22:34:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:09,208 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2019-11-15 22:34:09,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:34:09,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-15 22:34:09,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:09,211 INFO L225 Difference]: With dead ends: 77 [2019-11-15 22:34:09,211 INFO L226 Difference]: Without dead ends: 76 [2019-11-15 22:34:09,211 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-11-15 22:34:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-15 22:34:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-11-15 22:34:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-15 22:34:09,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2019-11-15 22:34:09,236 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 10 [2019-11-15 22:34:09,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:09,237 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2019-11-15 22:34:09,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:34:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2019-11-15 22:34:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 22:34:09,237 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:09,238 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:09,238 INFO L410 AbstractCegarLoop]: === Iteration 4 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:09,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:09,239 INFO L82 PathProgramCache]: Analyzing trace with hash 112275557, now seen corresponding path program 1 times [2019-11-15 22:34:09,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:09,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800201337] [2019-11-15 22:34:09,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:34:09,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800201337] [2019-11-15 22:34:09,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:09,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:34:09,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487417076] [2019-11-15 22:34:09,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:34:09,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:09,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:34:09,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:34:09,280 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand 3 states. [2019-11-15 22:34:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:09,299 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2019-11-15 22:34:09,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:34:09,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-15 22:34:09,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:09,301 INFO L225 Difference]: With dead ends: 69 [2019-11-15 22:34:09,302 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 22:34:09,302 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-11-15 22:34:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 22:34:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-11-15 22:34:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 22:34:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-11-15 22:34:09,314 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 11 [2019-11-15 22:34:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:09,314 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-11-15 22:34:09,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:34:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-11-15 22:34:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 22:34:09,315 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:09,316 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:09,316 INFO L410 AbstractCegarLoop]: === Iteration 5 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:09,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2048531074, now seen corresponding path program 1 times [2019-11-15 22:34:09,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:09,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824176085] [2019-11-15 22:34:09,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:34:09,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824176085] [2019-11-15 22:34:09,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:09,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:34:09,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410593227] [2019-11-15 22:34:09,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:34:09,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:09,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:34:09,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:34:09,380 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 6 states. [2019-11-15 22:34:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:09,437 INFO L93 Difference]: Finished difference Result 125 states and 160 transitions. [2019-11-15 22:34:09,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:34:09,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-15 22:34:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:09,439 INFO L225 Difference]: With dead ends: 125 [2019-11-15 22:34:09,439 INFO L226 Difference]: Without dead ends: 86 [2019-11-15 22:34:09,441 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:34:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-15 22:34:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-11-15 22:34:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-15 22:34:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-11-15 22:34:09,453 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 16 [2019-11-15 22:34:09,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:09,454 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-11-15 22:34:09,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:34:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-11-15 22:34:09,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 22:34:09,455 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:09,455 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:09,455 INFO L410 AbstractCegarLoop]: === Iteration 6 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash -57180086, now seen corresponding path program 1 times [2019-11-15 22:34:09,456 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:09,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827153630] [2019-11-15 22:34:09,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:34:09,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827153630] [2019-11-15 22:34:09,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:09,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:34:09,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195888842] [2019-11-15 22:34:09,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:34:09,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:09,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:34:09,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:34:09,489 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 3 states. [2019-11-15 22:34:09,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:09,509 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2019-11-15 22:34:09,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:34:09,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 22:34:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:09,512 INFO L225 Difference]: With dead ends: 76 [2019-11-15 22:34:09,512 INFO L226 Difference]: Without dead ends: 75 [2019-11-15 22:34:09,513 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-11-15 22:34:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-15 22:34:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-15 22:34:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-15 22:34:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2019-11-15 22:34:09,537 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 18 [2019-11-15 22:34:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:09,538 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2019-11-15 22:34:09,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:34:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2019-11-15 22:34:09,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 22:34:09,546 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:09,546 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:09,546 INFO L410 AbstractCegarLoop]: === Iteration 7 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:09,547 INFO L82 PathProgramCache]: Analyzing trace with hash -599425808, now seen corresponding path program 1 times [2019-11-15 22:34:09,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:09,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504221009] [2019-11-15 22:34:09,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:34:09,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504221009] [2019-11-15 22:34:09,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:09,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:34:09,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291835519] [2019-11-15 22:34:09,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:34:09,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:09,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:34:09,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:34:09,579 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand 3 states. [2019-11-15 22:34:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:09,591 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2019-11-15 22:34:09,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:34:09,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 22:34:09,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:09,593 INFO L225 Difference]: With dead ends: 75 [2019-11-15 22:34:09,593 INFO L226 Difference]: Without dead ends: 74 [2019-11-15 22:34:09,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11-15 22:34:09,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-15 22:34:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-15 22:34:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-15 22:34:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-15 22:34:09,608 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 19 [2019-11-15 22:34:09,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:09,608 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-15 22:34:09,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:34:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-15 22:34:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 22:34:09,610 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:09,610 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:09,610 INFO L410 AbstractCegarLoop]: === Iteration 8 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:09,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:09,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1772582622, now seen corresponding path program 1 times [2019-11-15 22:34:09,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:09,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084528553] [2019-11-15 22:34:09,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:34:09,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084528553] [2019-11-15 22:34:09,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:09,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:34:09,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964685499] [2019-11-15 22:34:09,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:09,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:09,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:09,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:09,641 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 4 states. [2019-11-15 22:34:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:09,661 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2019-11-15 22:34:09,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:09,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-15 22:34:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:09,663 INFO L225 Difference]: With dead ends: 95 [2019-11-15 22:34:09,663 INFO L226 Difference]: Without dead ends: 94 [2019-11-15 22:34:09,664 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-11-15 22:34:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-15 22:34:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2019-11-15 22:34:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-15 22:34:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-11-15 22:34:09,675 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 19 [2019-11-15 22:34:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:09,676 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-11-15 22:34:09,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-11-15 22:34:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:34:09,677 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:09,677 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:09,677 INFO L410 AbstractCegarLoop]: === Iteration 9 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:09,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:09,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1402330794, now seen corresponding path program 1 times [2019-11-15 22:34:09,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:09,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618790] [2019-11-15 22:34:09,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:34:09,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618790] [2019-11-15 22:34:09,708 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:09,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:34:09,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553364889] [2019-11-15 22:34:09,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:09,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:09,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:09,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:09,710 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 4 states. [2019-11-15 22:34:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:09,730 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-11-15 22:34:09,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:09,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-15 22:34:09,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:09,732 INFO L225 Difference]: With dead ends: 89 [2019-11-15 22:34:09,732 INFO L226 Difference]: Without dead ends: 83 [2019-11-15 22:34:09,732 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-15 22:34:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-15 22:34:09,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-15 22:34:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-15 22:34:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-11-15 22:34:09,742 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 20 [2019-11-15 22:34:09,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:09,742 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-11-15 22:34:09,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-11-15 22:34:09,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:34:09,743 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:09,743 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:09,744 INFO L410 AbstractCegarLoop]: === Iteration 10 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:09,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:09,744 INFO L82 PathProgramCache]: Analyzing trace with hash 921726737, now seen corresponding path program 1 times [2019-11-15 22:34:09,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:09,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54144845] [2019-11-15 22:34:09,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:34:09,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54144845] [2019-11-15 22:34:09,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:09,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:34:09,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684549841] [2019-11-15 22:34:09,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:34:09,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:09,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:34:09,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:34:09,811 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 6 states. [2019-11-15 22:34:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:09,902 INFO L93 Difference]: Finished difference Result 167 states and 222 transitions. [2019-11-15 22:34:09,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:34:09,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-15 22:34:09,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:09,907 INFO L225 Difference]: With dead ends: 167 [2019-11-15 22:34:09,907 INFO L226 Difference]: Without dead ends: 101 [2019-11-15 22:34:09,909 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-11-15 22:34:09,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-15 22:34:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2019-11-15 22:34:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 22:34:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-11-15 22:34:09,929 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 23 [2019-11-15 22:34:09,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:09,930 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-11-15 22:34:09,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:34:09,931 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-11-15 22:34:09,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 22:34:09,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:09,935 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:09,936 INFO L410 AbstractCegarLoop]: === Iteration 11 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:09,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:09,937 INFO L82 PathProgramCache]: Analyzing trace with hash 970950199, now seen corresponding path program 1 times [2019-11-15 22:34:09,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:09,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710982337] [2019-11-15 22:34:09,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:09,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,022 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 22:34:10,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710982337] [2019-11-15 22:34:10,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:10,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:34:10,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124007536] [2019-11-15 22:34:10,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:34:10,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:10,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:34:10,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:34:10,023 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-11-15 22:34:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:10,107 INFO L93 Difference]: Finished difference Result 176 states and 226 transitions. [2019-11-15 22:34:10,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:34:10,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-15 22:34:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:10,109 INFO L225 Difference]: With dead ends: 176 [2019-11-15 22:34:10,109 INFO L226 Difference]: Without dead ends: 105 [2019-11-15 22:34:10,111 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-11-15 22:34:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-15 22:34:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-11-15 22:34:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 22:34:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2019-11-15 22:34:10,124 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 34 [2019-11-15 22:34:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:10,124 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2019-11-15 22:34:10,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:34:10,124 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2019-11-15 22:34:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:34:10,127 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:10,127 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, 1] [2019-11-15 22:34:10,128 INFO L410 AbstractCegarLoop]: === Iteration 12 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:10,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:10,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1027694963, now seen corresponding path program 1 times [2019-11-15 22:34:10,128 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:10,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502861409] [2019-11-15 22:34:10,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:10,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:10,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 22:34:10,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502861409] [2019-11-15 22:34:10,188 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:10,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:34:10,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42507591] [2019-11-15 22:34:10,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:10,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:10,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:10,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:10,189 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 4 states. [2019-11-15 22:34:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:10,212 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2019-11-15 22:34:10,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:10,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-15 22:34:10,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:10,214 INFO L225 Difference]: With dead ends: 104 [2019-11-15 22:34:10,215 INFO L226 Difference]: Without dead ends: 103 [2019-11-15 22:34:10,215 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-11-15 22:34:10,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-15 22:34:10,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-11-15 22:34:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-15 22:34:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2019-11-15 22:34:10,225 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 37 [2019-11-15 22:34:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:10,225 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2019-11-15 22:34:10,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2019-11-15 22:34:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:34:10,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:10,227 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, 1, 1, 1] [2019-11-15 22:34:10,227 INFO L410 AbstractCegarLoop]: === Iteration 13 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:10,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:10,228 INFO L82 PathProgramCache]: Analyzing trace with hash 860890908, now seen corresponding path program 1 times [2019-11-15 22:34:10,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:10,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825505899] [2019-11-15 22:34:10,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:10,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:10,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 22:34:10,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825505899] [2019-11-15 22:34:10,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:10,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:34:10,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413444137] [2019-11-15 22:34:10,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:34:10,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:10,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:34:10,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:34:10,254 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 3 states. [2019-11-15 22:34:10,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:10,269 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2019-11-15 22:34:10,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:34:10,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-15 22:34:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:10,271 INFO L225 Difference]: With dead ends: 101 [2019-11-15 22:34:10,271 INFO L226 Difference]: Without dead ends: 100 [2019-11-15 22:34:10,272 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-11-15 22:34:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-15 22:34:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-15 22:34:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 22:34:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2019-11-15 22:34:10,280 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 33 [2019-11-15 22:34:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:10,281 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2019-11-15 22:34:10,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:34:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2019-11-15 22:34:10,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 22:34:10,282 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:10,282 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:10,283 INFO L410 AbstractCegarLoop]: === Iteration 14 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:10,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:10,283 INFO L82 PathProgramCache]: Analyzing trace with hash -747989016, now seen corresponding path program 1 times [2019-11-15 22:34:10,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:10,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417860201] [2019-11-15 22:34:10,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:10,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:10,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 22:34:10,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417860201] [2019-11-15 22:34:10,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:10,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:34:10,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692724001] [2019-11-15 22:34:10,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:34:10,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:10,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:34:10,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:34:10,364 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 6 states. [2019-11-15 22:34:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:10,418 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2019-11-15 22:34:10,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:34:10,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-15 22:34:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:10,421 INFO L225 Difference]: With dead ends: 110 [2019-11-15 22:34:10,421 INFO L226 Difference]: Without dead ends: 109 [2019-11-15 22:34:10,421 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-11-15 22:34:10,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-15 22:34:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2019-11-15 22:34:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-15 22:34:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-11-15 22:34:10,430 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 43 [2019-11-15 22:34:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:10,430 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-11-15 22:34:10,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:34:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-11-15 22:34:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 22:34:10,431 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:10,431 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:10,432 INFO L410 AbstractCegarLoop]: === Iteration 15 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:10,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:10,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1488967228, now seen corresponding path program 1 times [2019-11-15 22:34:10,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:10,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301366496] [2019-11-15 22:34:10,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:10,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:10,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 22:34:10,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301366496] [2019-11-15 22:34:10,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537333076] [2019-11-15 22:34:10,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/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-11-15 22:34:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:10,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:34:10,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 22:34:10,711 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:34:10,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-11-15 22:34:10,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359930040] [2019-11-15 22:34:10,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:34:10,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:10,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:34:10,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:34:10,712 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 7 states. [2019-11-15 22:34:10,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:10,815 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2019-11-15 22:34:10,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:34:10,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-15 22:34:10,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:10,817 INFO L225 Difference]: With dead ends: 100 [2019-11-15 22:34:10,817 INFO L226 Difference]: Without dead ends: 99 [2019-11-15 22:34:10,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:34:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-15 22:34:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-11-15 22:34:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 22:34:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2019-11-15 22:34:10,833 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 40 [2019-11-15 22:34:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:10,833 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2019-11-15 22:34:10,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:34:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2019-11-15 22:34:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:34:10,834 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:10,834 INFO L380 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:11,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:34:11,035 INFO L410 AbstractCegarLoop]: === Iteration 16 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:11,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1798417111, now seen corresponding path program 1 times [2019-11-15 22:34:11,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:11,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494373282] [2019-11-15 22:34:11,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:11,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:11,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 22:34:11,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494373282] [2019-11-15 22:34:11,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773536559] [2019-11-15 22:34:11,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/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-11-15 22:34:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:11,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:34:11,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 22:34:11,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:34:11,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-11-15 22:34:11,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618337848] [2019-11-15 22:34:11,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:34:11,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:11,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:34:11,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:34:11,241 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 7 states. [2019-11-15 22:34:11,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:11,418 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2019-11-15 22:34:11,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:34:11,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-15 22:34:11,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:11,420 INFO L225 Difference]: With dead ends: 126 [2019-11-15 22:34:11,420 INFO L226 Difference]: Without dead ends: 125 [2019-11-15 22:34:11,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 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-11-15 22:34:11,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-15 22:34:11,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-11-15 22:34:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 22:34:11,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2019-11-15 22:34:11,429 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 47 [2019-11-15 22:34:11,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:11,430 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2019-11-15 22:34:11,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:34:11,430 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2019-11-15 22:34:11,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:34:11,431 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:11,431 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:11,634 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:34:11,635 INFO L410 AbstractCegarLoop]: === Iteration 17 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:11,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:11,635 INFO L82 PathProgramCache]: Analyzing trace with hash 695736933, now seen corresponding path program 1 times [2019-11-15 22:34:11,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:11,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099626397] [2019-11-15 22:34:11,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:11,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:11,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 22:34:11,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099626397] [2019-11-15 22:34:11,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853327356] [2019-11-15 22:34:11,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/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-11-15 22:34:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:11,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:34:11,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 22:34:11,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:34:11,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2019-11-15 22:34:11,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588643237] [2019-11-15 22:34:11,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:34:11,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:11,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:34:11,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:34:11,811 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand 5 states. [2019-11-15 22:34:11,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:11,881 INFO L93 Difference]: Finished difference Result 152 states and 185 transitions. [2019-11-15 22:34:11,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:34:11,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 22:34:11,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:11,884 INFO L225 Difference]: With dead ends: 152 [2019-11-15 22:34:11,884 INFO L226 Difference]: Without dead ends: 151 [2019-11-15 22:34:11,884 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:34:11,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-15 22:34:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-11-15 22:34:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 22:34:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 184 transitions. [2019-11-15 22:34:11,897 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 184 transitions. Word has length 45 [2019-11-15 22:34:11,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:11,898 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 184 transitions. [2019-11-15 22:34:11,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:34:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2019-11-15 22:34:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 22:34:11,899 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:11,899 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:12,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:34:12,102 INFO L410 AbstractCegarLoop]: === Iteration 18 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:12,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:12,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1252678887, now seen corresponding path program 1 times [2019-11-15 22:34:12,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:12,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106017501] [2019-11-15 22:34:12,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:12,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:12,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-15 22:34:12,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106017501] [2019-11-15 22:34:12,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271320516] [2019-11-15 22:34:12,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/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-11-15 22:34:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:34:12,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-15 22:34:12,250 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:34:12,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-15 22:34:12,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519353422] [2019-11-15 22:34:12,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:34:12,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:12,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:34:12,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:34:12,252 INFO L87 Difference]: Start difference. First operand 150 states and 184 transitions. Second operand 6 states. [2019-11-15 22:34:12,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:12,279 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2019-11-15 22:34:12,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:34:12,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 22:34:12,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:12,283 INFO L225 Difference]: With dead ends: 159 [2019-11-15 22:34:12,284 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 22:34:12,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:34:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 22:34:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-15 22:34:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-15 22:34:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 189 transitions. [2019-11-15 22:34:12,296 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 189 transitions. Word has length 60 [2019-11-15 22:34:12,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:12,297 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 189 transitions. [2019-11-15 22:34:12,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:34:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 189 transitions. [2019-11-15 22:34:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 22:34:12,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:12,298 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, 1, 1] [2019-11-15 22:34:12,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:34:12,502 INFO L410 AbstractCegarLoop]: === Iteration 19 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:12,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:12,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1713501635, now seen corresponding path program 2 times [2019-11-15 22:34:12,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:12,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326979176] [2019-11-15 22:34:12,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:12,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:12,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 67 proven. 32 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-15 22:34:12,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326979176] [2019-11-15 22:34:12,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064194552] [2019-11-15 22:34:12,687 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:34:12,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:34:12,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:34:12,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:34:12,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:12,786 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 71 proven. 28 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-15 22:34:12,786 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:34:12,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2019-11-15 22:34:12,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631859181] [2019-11-15 22:34:12,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:34:12,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:12,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:34:12,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:34:12,794 INFO L87 Difference]: Start difference. First operand 155 states and 189 transitions. Second operand 13 states. [2019-11-15 22:34:13,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:13,034 INFO L93 Difference]: Finished difference Result 234 states and 284 transitions. [2019-11-15 22:34:13,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:34:13,034 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2019-11-15 22:34:13,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:13,035 INFO L225 Difference]: With dead ends: 234 [2019-11-15 22:34:13,035 INFO L226 Difference]: Without dead ends: 97 [2019-11-15 22:34:13,037 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-11-15 22:34:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-15 22:34:13,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2019-11-15 22:34:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-15 22:34:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-11-15 22:34:13,042 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 82 [2019-11-15 22:34:13,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:13,043 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-11-15 22:34:13,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:34:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-11-15 22:34:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-15 22:34:13,044 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:13,044 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-11-15 22:34:13,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:34:13,249 INFO L410 AbstractCegarLoop]: === Iteration 20 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 22:34:13,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:13,249 INFO L82 PathProgramCache]: Analyzing trace with hash -151262980, now seen corresponding path program 2 times [2019-11-15 22:34:13,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:13,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246040306] [2019-11-15 22:34:13,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:13,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:13,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 73 proven. 96 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-11-15 22:34:13,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246040306] [2019-11-15 22:34:13,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325790625] [2019-11-15 22:34:13,632 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:34:13,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:34:13,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:34:13,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:34:13,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 48 proven. 78 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-11-15 22:34:13,807 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:34:13,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 23 [2019-11-15 22:34:13,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134919188] [2019-11-15 22:34:13,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 22:34:13,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:13,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 22:34:13,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:34:13,810 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 23 states. [2019-11-15 22:34:14,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:14,215 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-11-15 22:34:14,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:34:14,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 124 [2019-11-15 22:34:14,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:14,216 INFO L225 Difference]: With dead ends: 95 [2019-11-15 22:34:14,216 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:34:14,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:34:14,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:34:14,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:34:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:34:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:34:14,218 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2019-11-15 22:34:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:14,218 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:34:14,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 22:34:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:34:14,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:34:14,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:34:14,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:34:14,731 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2019-11-15 22:34:14,907 INFO L443 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-11-15 22:34:14,907 INFO L443 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-11-15 22:34:14,907 INFO L443 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-15 22:34:14,908 INFO L443 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-15 22:34:14,908 INFO L443 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-15 22:34:14,908 INFO L443 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-15 22:34:14,908 INFO L443 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-15 22:34:14,908 INFO L446 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-11-15 22:34:14,908 INFO L443 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-11-15 22:34:14,908 INFO L443 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-11-15 22:34:14,908 INFO L443 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-15 22:34:14,908 INFO L439 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (and (or (= |rec1_#in~i| rec1_~i) (not (<= |rec1_#in~i| 2147483647))) (not (<= |rec1_#in~i| 0))) [2019-11-15 22:34:14,909 INFO L443 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-11-15 22:34:14,909 INFO L443 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-11-15 22:34:14,909 INFO L443 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-11-15 22:34:14,909 INFO L439 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (and (or (not (<= |rec1_#in~i| 2147483647)) (and (<= |rec1_#t~ret0| 1) (= |rec1_#in~i| rec1_~i))) (not (<= |rec1_#in~i| 0))) [2019-11-15 22:34:14,909 INFO L443 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-11-15 22:34:14,909 INFO L439 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (and (or (not (<= |rec1_#in~i| 2147483647)) (and (<= |rec1_#t~ret1| 0) (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1))) (or (<= 1 rec1_~i) (not (<= |rec1_#in~i| 2147483646)))) [2019-11-15 22:34:14,909 INFO L443 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-11-15 22:34:14,909 INFO L443 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-15 22:34:14,909 INFO L443 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-11-15 22:34:14,909 INFO L443 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-11-15 22:34:14,909 INFO L443 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-11-15 22:34:14,910 INFO L443 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-11-15 22:34:14,910 INFO L443 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-15 22:34:14,910 INFO L443 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-15 22:34:14,910 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-11-15 22:34:14,910 INFO L439 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (and (or (= rec2_~j |rec2_#in~j|) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-11-15 22:34:14,910 INFO L443 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-15 22:34:14,910 INFO L439 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (let ((.cse0 (not (<= |rec2_#in~j| 2147483647)))) (and (or (= rec2_~j |rec2_#in~j|) .cse0) (or (and (<= |rec2_#t~ret3| 1) (<= (+ |rec2_#t~ret3| 1) |rec2_#in~j|)) .cse0) (not (<= |rec2_#in~j| 0)))) [2019-11-15 22:34:14,910 INFO L443 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-15 22:34:14,910 INFO L443 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-15 22:34:14,910 INFO L443 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-15 22:34:14,910 INFO L443 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-15 22:34:14,911 INFO L443 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-11-15 22:34:14,911 INFO L443 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-15 22:34:14,911 INFO L443 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-15 22:34:14,911 INFO L446 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-11-15 22:34:14,911 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:34:14,911 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:34:14,911 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:34:14,911 INFO L439 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-15 22:34:14,911 INFO L443 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-11-15 22:34:14,911 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-11-15 22:34:14,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:34:14 BoogieIcfgContainer [2019-11-15 22:34:14,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:34:14,925 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:34:14,925 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:34:14,926 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:34:14,926 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:34:08" (3/4) ... [2019-11-15 22:34:14,929 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:34:14,937 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-11-15 22:34:14,937 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-11-15 22:34:14,944 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 22:34:14,944 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:34:15,003 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3b1eff70-8954-4b2f-a1fb-9cb9b668d005/bin/uautomizer/witness.graphml [2019-11-15 22:34:15,003 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:34:15,004 INFO L168 Benchmark]: Toolchain (without parser) took 7121.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 946.1 MB in the beginning and 914.7 MB in the end (delta: 31.4 MB). Peak memory consumption was 203.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:15,004 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:34:15,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:15,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.45 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:15,005 INFO L168 Benchmark]: Boogie Preprocessor took 12.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:34:15,006 INFO L168 Benchmark]: RCFGBuilder took 262.77 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:15,006 INFO L168 Benchmark]: TraceAbstraction took 6443.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.9 MB). Free memory was 1.1 GB in the beginning and 922.7 MB in the end (delta: 179.3 MB). Peak memory consumption was 220.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:15,007 INFO L168 Benchmark]: Witness Printer took 77.87 ms. Allocated memory is still 1.2 GB. Free memory was 922.7 MB in the beginning and 914.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:15,009 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.45 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 262.77 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6443.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.9 MB). Free memory was 1.1 GB in the beginning and 922.7 MB in the end (delta: 179.3 MB). Peak memory consumption was 220.2 MB. Max. memory is 11.5 GB. * Witness Printer took 77.87 ms. Allocated memory is still 1.2 GB. Free memory was 922.7 MB in the beginning and 914.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 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: 6.3s, OverallIterations: 20, TraceHistogramMax: 12, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 761 SDtfs, 331 SDslu, 2113 SDs, 0 SdLazy, 1002 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=18, 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, 20 MinimizatonAttempts, 93 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 222 PreInvPairs, 238 NumberOfFragments, 99 HoareAnnotationTreeSize, 222 FomulaSimplifications, 669 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 455 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1090 NumberOfCodeBlocks, 1090 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1064 ConstructedInterpolants, 0 QuantifiedInterpolants, 115726 SizeOfPredicates, 8 NumberOfNonLiveVariables, 820 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 26 InterpolantComputations, 17 PerfectInterpolantSequences, 1326/1576 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...