./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c -s /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0837a1e1d82be1b28ccf3514392f1b01c88a9160 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:48:34,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:48:34,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:48:34,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:48:34,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:48:34,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:48:34,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:48:34,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:48:34,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:48:34,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:48:34,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:48:34,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:48:34,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:48:34,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:48:34,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:48:34,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:48:34,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:48:34,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:48:34,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:48:34,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:48:34,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:48:34,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:48:34,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:48:34,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:48:34,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:48:34,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:48:34,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:48:34,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:48:34,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:48:34,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:48:34,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:48:34,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:48:34,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:48:34,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:48:34,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:48:34,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:48:34,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:48:34,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:48:34,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:48:34,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:48:34,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:48:34,524 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-25 08:48:34,549 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:48:34,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:48:34,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:48:34,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:48:34,551 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:48:34,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:48:34,551 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:48:34,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:48:34,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:48:34,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:48:34,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:48:34,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:48:34,552 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-25 08:48:34,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:48:34,553 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:48:34,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:48:34,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:48:34,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:48:34,553 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:48:34,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:48:34,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:48:34,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:48:34,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:48:34,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:48:34,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:48:34,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:48:34,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:48:34,555 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_75d050ca-7cf4-4da2-bf79-1d601c61faa3/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2019-11-25 08:48:34,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:48:34,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:48:34,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:48:34,731 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:48:34,731 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:48:34,732 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-11-25 08:48:34,787 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/bin/uautomizer/data/6c9ce98aa/191956d7622e45d6a8593b4ac7f47556/FLAG64212f5af [2019-11-25 08:48:35,178 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:48:35,179 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-11-25 08:48:35,186 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/bin/uautomizer/data/6c9ce98aa/191956d7622e45d6a8593b4ac7f47556/FLAG64212f5af [2019-11-25 08:48:35,196 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/bin/uautomizer/data/6c9ce98aa/191956d7622e45d6a8593b4ac7f47556 [2019-11-25 08:48:35,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:48:35,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:48:35,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:48:35,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:48:35,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:48:35,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73891909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35, skipping insertion in model container [2019-11-25 08:48:35,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:48:35,232 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:48:35,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:48:35,358 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:48:35,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:48:35,439 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:48:35,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35 WrapperNode [2019-11-25 08:48:35,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:48:35,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:48:35,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:48:35,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:48:35,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:48:35,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:48:35,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:48:35,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:48:35,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... [2019-11-25 08:48:35,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:48:35,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:48:35,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:48:35,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:48:35,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/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-25 08:48:35,546 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-11-25 08:48:35,547 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-11-25 08:48:35,547 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-11-25 08:48:35,547 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-11-25 08:48:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:48:35,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:48:35,874 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:48:35,874 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-25 08:48:35,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:35 BoogieIcfgContainer [2019-11-25 08:48:35,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:48:35,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:48:35,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:48:35,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:48:35,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:48:35" (1/3) ... [2019-11-25 08:48:35,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eeea522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:48:35, skipping insertion in model container [2019-11-25 08:48:35,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:35" (2/3) ... [2019-11-25 08:48:35,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eeea522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:48:35, skipping insertion in model container [2019-11-25 08:48:35,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:35" (3/3) ... [2019-11-25 08:48:35,882 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d.c [2019-11-25 08:48:35,891 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:48:35,896 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-25 08:48:35,906 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-25 08:48:35,927 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:48:35,927 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:48:35,927 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:48:35,927 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:48:35,928 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:48:35,928 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:48:35,928 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:48:35,928 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:48:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-11-25 08:48:35,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-25 08:48:35,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:35,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:35,950 INFO L410 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:35,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:35,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1656652383, now seen corresponding path program 1 times [2019-11-25 08:48:35,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:35,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940999792] [2019-11-25 08:48:35,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:36,131 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-25 08:48:36,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940999792] [2019-11-25 08:48:36,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:36,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:48:36,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731433944] [2019-11-25 08:48:36,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:48:36,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:36,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:48:36,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:48:36,150 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 7 states. [2019-11-25 08:48:36,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:36,353 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-11-25 08:48:36,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:48:36,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-11-25 08:48:36,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:36,365 INFO L225 Difference]: With dead ends: 86 [2019-11-25 08:48:36,365 INFO L226 Difference]: Without dead ends: 79 [2019-11-25 08:48:36,368 INFO L630 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-25 08:48:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-25 08:48:36,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2019-11-25 08:48:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-25 08:48:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-11-25 08:48:36,416 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 8 [2019-11-25 08:48:36,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:36,416 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-11-25 08:48:36,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:48:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-11-25 08:48:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 08:48:36,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:36,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:36,418 INFO L410 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:36,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:36,419 INFO L82 PathProgramCache]: Analyzing trace with hash -183383641, now seen corresponding path program 1 times [2019-11-25 08:48:36,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:36,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033458788] [2019-11-25 08:48:36,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:36,442 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-25 08:48:36,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033458788] [2019-11-25 08:48:36,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:36,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:48:36,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343725839] [2019-11-25 08:48:36,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:36,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:36,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:36,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:36,445 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-11-25 08:48:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:36,459 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2019-11-25 08:48:36,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:36,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-25 08:48:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:36,461 INFO L225 Difference]: With dead ends: 70 [2019-11-25 08:48:36,462 INFO L226 Difference]: Without dead ends: 69 [2019-11-25 08:48:36,463 INFO L630 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-25 08:48:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-25 08:48:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-11-25 08:48:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-25 08:48:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2019-11-25 08:48:36,478 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 9 [2019-11-25 08:48:36,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:36,478 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2019-11-25 08:48:36,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2019-11-25 08:48:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 08:48:36,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:36,479 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:36,479 INFO L410 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:36,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:36,480 INFO L82 PathProgramCache]: Analyzing trace with hash -138388889, now seen corresponding path program 1 times [2019-11-25 08:48:36,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:36,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270395876] [2019-11-25 08:48:36,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:36,524 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-25 08:48:36,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270395876] [2019-11-25 08:48:36,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:36,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:48:36,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520854876] [2019-11-25 08:48:36,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:36,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:36,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:36,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:36,526 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand 3 states. [2019-11-25 08:48:36,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:36,549 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-11-25 08:48:36,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:36,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-25 08:48:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:36,554 INFO L225 Difference]: With dead ends: 65 [2019-11-25 08:48:36,554 INFO L226 Difference]: Without dead ends: 64 [2019-11-25 08:48:36,554 INFO L630 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-25 08:48:36,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-25 08:48:36,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-25 08:48:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-25 08:48:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2019-11-25 08:48:36,573 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 11 [2019-11-25 08:48:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:36,573 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2019-11-25 08:48:36,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2019-11-25 08:48:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 08:48:36,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:36,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:36,575 INFO L410 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:36,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:36,575 INFO L82 PathProgramCache]: Analyzing trace with hash 4911801, now seen corresponding path program 1 times [2019-11-25 08:48:36,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:36,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719977706] [2019-11-25 08:48:36,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:36,628 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-25 08:48:36,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719977706] [2019-11-25 08:48:36,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:36,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:48:36,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117243866] [2019-11-25 08:48:36,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:36,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:36,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:36,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:36,630 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 4 states. [2019-11-25 08:48:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:36,651 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2019-11-25 08:48:36,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:36,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-25 08:48:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:36,653 INFO L225 Difference]: With dead ends: 85 [2019-11-25 08:48:36,654 INFO L226 Difference]: Without dead ends: 84 [2019-11-25 08:48:36,654 INFO L630 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-25 08:48:36,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-25 08:48:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2019-11-25 08:48:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-25 08:48:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2019-11-25 08:48:36,668 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 12 [2019-11-25 08:48:36,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:36,669 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2019-11-25 08:48:36,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:36,669 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2019-11-25 08:48:36,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 08:48:36,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:36,670 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:36,671 INFO L410 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:36,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:36,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2115393736, now seen corresponding path program 1 times [2019-11-25 08:48:36,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:36,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685137962] [2019-11-25 08:48:36,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:36,692 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-25 08:48:36,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685137962] [2019-11-25 08:48:36,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:36,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:48:36,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217199322] [2019-11-25 08:48:36,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:36,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:36,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:36,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:36,694 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 3 states. [2019-11-25 08:48:36,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:36,710 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2019-11-25 08:48:36,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:36,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-25 08:48:36,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:36,712 INFO L225 Difference]: With dead ends: 74 [2019-11-25 08:48:36,712 INFO L226 Difference]: Without dead ends: 73 [2019-11-25 08:48:36,713 INFO L630 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-25 08:48:36,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-25 08:48:36,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-25 08:48:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-25 08:48:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2019-11-25 08:48:36,724 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 16 [2019-11-25 08:48:36,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:36,724 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2019-11-25 08:48:36,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2019-11-25 08:48:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 08:48:36,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:36,726 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:36,726 INFO L410 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:36,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:36,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1152696420, now seen corresponding path program 1 times [2019-11-25 08:48:36,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:36,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894994437] [2019-11-25 08:48:36,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:36,757 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-25 08:48:36,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894994437] [2019-11-25 08:48:36,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:36,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:48:36,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572188796] [2019-11-25 08:48:36,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:36,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:36,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:36,759 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand 4 states. [2019-11-25 08:48:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:36,786 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-11-25 08:48:36,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:36,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-25 08:48:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:36,788 INFO L225 Difference]: With dead ends: 94 [2019-11-25 08:48:36,788 INFO L226 Difference]: Without dead ends: 93 [2019-11-25 08:48:36,789 INFO L630 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-25 08:48:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-25 08:48:36,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2019-11-25 08:48:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-25 08:48:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2019-11-25 08:48:36,805 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 17 [2019-11-25 08:48:36,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:36,805 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2019-11-25 08:48:36,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2019-11-25 08:48:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:48:36,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:36,807 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:36,807 INFO L410 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:36,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1079409517, now seen corresponding path program 1 times [2019-11-25 08:48:36,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:36,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196731054] [2019-11-25 08:48:36,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:36,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196731054] [2019-11-25 08:48:36,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462402152] [2019-11-25 08:48:36,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/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-25 08:48:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:36,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:48:36,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:37,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:48:37,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-11-25 08:48:37,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333716259] [2019-11-25 08:48:37,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:48:37,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:37,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:48:37,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:48:37,025 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 5 states. [2019-11-25 08:48:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:37,095 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2019-11-25 08:48:37,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:48:37,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-25 08:48:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:37,097 INFO L225 Difference]: With dead ends: 125 [2019-11-25 08:48:37,097 INFO L226 Difference]: Without dead ends: 75 [2019-11-25 08:48:37,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:48:37,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-25 08:48:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-11-25 08:48:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-25 08:48:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2019-11-25 08:48:37,109 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 19 [2019-11-25 08:48:37,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:37,110 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2019-11-25 08:48:37,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:48:37,110 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2019-11-25 08:48:37,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 08:48:37,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:37,111 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:37,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:48:37,314 INFO L410 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:37,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:37,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1643853139, now seen corresponding path program 1 times [2019-11-25 08:48:37,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:37,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269713448] [2019-11-25 08:48:37,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,399 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-25 08:48:37,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269713448] [2019-11-25 08:48:37,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:37,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:48:37,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883583839] [2019-11-25 08:48:37,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:48:37,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:37,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:48:37,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:48:37,401 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 6 states. [2019-11-25 08:48:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:37,506 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2019-11-25 08:48:37,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:48:37,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-25 08:48:37,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:37,508 INFO L225 Difference]: With dead ends: 149 [2019-11-25 08:48:37,508 INFO L226 Difference]: Without dead ends: 91 [2019-11-25 08:48:37,511 INFO L630 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-25 08:48:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-25 08:48:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2019-11-25 08:48:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-25 08:48:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2019-11-25 08:48:37,525 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 21 [2019-11-25 08:48:37,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:37,526 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2019-11-25 08:48:37,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:48:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2019-11-25 08:48:37,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:48:37,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:37,530 INFO L410 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:37,530 INFO L410 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:37,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:37,530 INFO L82 PathProgramCache]: Analyzing trace with hash 883505486, now seen corresponding path program 1 times [2019-11-25 08:48:37,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:37,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097414550] [2019-11-25 08:48:37,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-25 08:48:37,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097414550] [2019-11-25 08:48:37,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:37,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:48:37,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265032022] [2019-11-25 08:48:37,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:48:37,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:37,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:48:37,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:48:37,603 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand 6 states. [2019-11-25 08:48:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:37,669 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2019-11-25 08:48:37,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:48:37,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-11-25 08:48:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:37,671 INFO L225 Difference]: With dead ends: 158 [2019-11-25 08:48:37,671 INFO L226 Difference]: Without dead ends: 95 [2019-11-25 08:48:37,672 INFO L630 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-25 08:48:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-25 08:48:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2019-11-25 08:48:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-25 08:48:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2019-11-25 08:48:37,684 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 27 [2019-11-25 08:48:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:37,684 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2019-11-25 08:48:37,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:48:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2019-11-25 08:48:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 08:48:37,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:37,686 INFO L410 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] [2019-11-25 08:48:37,687 INFO L410 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:37,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1291302577, now seen corresponding path program 1 times [2019-11-25 08:48:37,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:37,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078174929] [2019-11-25 08:48:37,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,731 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-25 08:48:37,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078174929] [2019-11-25 08:48:37,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:37,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:48:37,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623822890] [2019-11-25 08:48:37,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:37,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:37,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:37,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:37,734 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 4 states. [2019-11-25 08:48:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:37,768 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2019-11-25 08:48:37,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:37,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-25 08:48:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:37,771 INFO L225 Difference]: With dead ends: 94 [2019-11-25 08:48:37,771 INFO L226 Difference]: Without dead ends: 93 [2019-11-25 08:48:37,771 INFO L630 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-25 08:48:37,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-25 08:48:37,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-11-25 08:48:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-25 08:48:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2019-11-25 08:48:37,785 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 35 [2019-11-25 08:48:37,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:37,786 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2019-11-25 08:48:37,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:37,786 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2019-11-25 08:48:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 08:48:37,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:37,787 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:37,788 INFO L410 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:37,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:37,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1375674171, now seen corresponding path program 1 times [2019-11-25 08:48:37,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:37,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700038926] [2019-11-25 08:48:37,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-25 08:48:37,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700038926] [2019-11-25 08:48:37,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:37,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:48:37,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083159117] [2019-11-25 08:48:37,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:37,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:37,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:37,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:37,828 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand 3 states. [2019-11-25 08:48:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:37,838 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2019-11-25 08:48:37,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:37,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-25 08:48:37,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:37,840 INFO L225 Difference]: With dead ends: 91 [2019-11-25 08:48:37,840 INFO L226 Difference]: Without dead ends: 90 [2019-11-25 08:48:37,841 INFO L630 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-25 08:48:37,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-25 08:48:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-11-25 08:48:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-25 08:48:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-11-25 08:48:37,850 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 36 [2019-11-25 08:48:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:37,850 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-11-25 08:48:37,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-11-25 08:48:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 08:48:37,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:37,852 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:37,852 INFO L410 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:37,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:37,853 INFO L82 PathProgramCache]: Analyzing trace with hash 930510463, now seen corresponding path program 1 times [2019-11-25 08:48:37,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:37,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632591340] [2019-11-25 08:48:37,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-25 08:48:37,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632591340] [2019-11-25 08:48:37,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:37,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:48:37,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404666087] [2019-11-25 08:48:37,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:48:37,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:37,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:48:37,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:48:37,942 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 6 states. [2019-11-25 08:48:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:37,981 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2019-11-25 08:48:37,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:48:37,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-25 08:48:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:37,983 INFO L225 Difference]: With dead ends: 90 [2019-11-25 08:48:37,983 INFO L226 Difference]: Without dead ends: 89 [2019-11-25 08:48:37,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:48:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-25 08:48:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-25 08:48:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-25 08:48:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-11-25 08:48:37,991 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 36 [2019-11-25 08:48:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:37,991 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-11-25 08:48:37,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:48:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-11-25 08:48:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-25 08:48:37,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:37,995 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:37,996 INFO L410 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:37,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:37,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1111626321, now seen corresponding path program 1 times [2019-11-25 08:48:37,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:37,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561597532] [2019-11-25 08:48:38,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-25 08:48:38,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561597532] [2019-11-25 08:48:38,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:38,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:48:38,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236444430] [2019-11-25 08:48:38,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:48:38,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:38,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:48:38,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:48:38,101 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-11-25 08:48:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:38,152 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2019-11-25 08:48:38,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:48:38,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-25 08:48:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:38,154 INFO L225 Difference]: With dead ends: 99 [2019-11-25 08:48:38,154 INFO L226 Difference]: Without dead ends: 98 [2019-11-25 08:48:38,154 INFO L630 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-25 08:48:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-25 08:48:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2019-11-25 08:48:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-25 08:48:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2019-11-25 08:48:38,162 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 46 [2019-11-25 08:48:38,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:38,163 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2019-11-25 08:48:38,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:48:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2019-11-25 08:48:38,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:48:38,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:38,164 INFO L410 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] [2019-11-25 08:48:38,165 INFO L410 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:38,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:38,165 INFO L82 PathProgramCache]: Analyzing trace with hash 138300185, now seen corresponding path program 1 times [2019-11-25 08:48:38,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:38,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675457032] [2019-11-25 08:48:38,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,248 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-25 08:48:38,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675457032] [2019-11-25 08:48:38,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30004082] [2019-11-25 08:48:38,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/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-25 08:48:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:48:38,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:38,365 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-25 08:48:38,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:48:38,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-11-25 08:48:38,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522165551] [2019-11-25 08:48:38,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:48:38,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:38,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:48:38,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:48:38,367 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 7 states. [2019-11-25 08:48:38,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:38,547 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2019-11-25 08:48:38,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:48:38,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-11-25 08:48:38,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:38,549 INFO L225 Difference]: With dead ends: 116 [2019-11-25 08:48:38,549 INFO L226 Difference]: Without dead ends: 115 [2019-11-25 08:48:38,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 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-25 08:48:38,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-25 08:48:38,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-11-25 08:48:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-25 08:48:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2019-11-25 08:48:38,565 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 45 [2019-11-25 08:48:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:38,565 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2019-11-25 08:48:38,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:48:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2019-11-25 08:48:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-25 08:48:38,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:38,566 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:38,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:48:38,772 INFO L410 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:38,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:38,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1156205799, now seen corresponding path program 1 times [2019-11-25 08:48:38,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:38,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061728129] [2019-11-25 08:48:38,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-25 08:48:38,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061728129] [2019-11-25 08:48:38,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133498393] [2019-11-25 08:48:38,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/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-25 08:48:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:38,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:48:38,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-25 08:48:38,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:48:38,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-25 08:48:38,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064873573] [2019-11-25 08:48:38,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:48:38,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:38,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:48:38,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:48:38,913 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand 10 states. [2019-11-25 08:48:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:39,038 INFO L93 Difference]: Finished difference Result 224 states and 282 transitions. [2019-11-25 08:48:39,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:48:39,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-11-25 08:48:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:39,040 INFO L225 Difference]: With dead ends: 224 [2019-11-25 08:48:39,040 INFO L226 Difference]: Without dead ends: 145 [2019-11-25 08:48:39,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:48:39,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-25 08:48:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2019-11-25 08:48:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-25 08:48:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2019-11-25 08:48:39,055 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 43 [2019-11-25 08:48:39,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:39,056 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2019-11-25 08:48:39,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:48:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2019-11-25 08:48:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-25 08:48:39,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:39,058 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:39,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:48:39,264 INFO L410 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:39,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1154921966, now seen corresponding path program 1 times [2019-11-25 08:48:39,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:39,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534028818] [2019-11-25 08:48:39,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:48:39,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534028818] [2019-11-25 08:48:39,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:39,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:48:39,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060496478] [2019-11-25 08:48:39,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:39,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:39,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:39,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:39,290 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand 3 states. [2019-11-25 08:48:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:39,299 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2019-11-25 08:48:39,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:39,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-25 08:48:39,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:39,301 INFO L225 Difference]: With dead ends: 132 [2019-11-25 08:48:39,301 INFO L226 Difference]: Without dead ends: 131 [2019-11-25 08:48:39,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-25 08:48:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-25 08:48:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-25 08:48:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2019-11-25 08:48:39,310 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 43 [2019-11-25 08:48:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:39,311 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2019-11-25 08:48:39,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2019-11-25 08:48:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-25 08:48:39,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:39,312 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:39,312 INFO L410 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:39,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:39,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842648, now seen corresponding path program 1 times [2019-11-25 08:48:39,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:39,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290905994] [2019-11-25 08:48:39,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:48:39,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290905994] [2019-11-25 08:48:39,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:39,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:48:39,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51135560] [2019-11-25 08:48:39,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:39,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:39,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:39,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:39,348 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand 4 states. [2019-11-25 08:48:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:39,364 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2019-11-25 08:48:39,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:39,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-25 08:48:39,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:39,366 INFO L225 Difference]: With dead ends: 140 [2019-11-25 08:48:39,366 INFO L226 Difference]: Without dead ends: 132 [2019-11-25 08:48:39,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:39,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-25 08:48:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-11-25 08:48:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-25 08:48:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2019-11-25 08:48:39,376 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 44 [2019-11-25 08:48:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:39,376 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2019-11-25 08:48:39,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2019-11-25 08:48:39,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-25 08:48:39,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:39,377 INFO L410 BasicCegarLoop]: trace histogram [10, 8, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:39,377 INFO L410 AbstractCegarLoop]: === Iteration 18 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:48:39,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:39,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1995865818, now seen corresponding path program 2 times [2019-11-25 08:48:39,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:39,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2615385] [2019-11-25 08:48:39,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 60 proven. 32 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-25 08:48:39,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2615385] [2019-11-25 08:48:39,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968115312] [2019-11-25 08:48:39,518 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/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-25 08:48:39,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:48:39,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:48:39,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:48:39,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-25 08:48:39,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:48:39,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2019-11-25 08:48:39,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824871262] [2019-11-25 08:48:39,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 08:48:39,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:39,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:48:39,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:48:39,613 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 13 states. [2019-11-25 08:48:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:39,801 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2019-11-25 08:48:39,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:48:39,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2019-11-25 08:48:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:39,803 INFO L225 Difference]: With dead ends: 155 [2019-11-25 08:48:39,803 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:48:39,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-11-25 08:48:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:48:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:48:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:48:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:48:39,805 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2019-11-25 08:48:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:39,805 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:48:39,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 08:48:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:48:39,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:48:40,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:48:40,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:48:40,258 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 14 [2019-11-25 08:48:40,351 INFO L444 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-25 08:48:40,351 INFO L444 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-11-25 08:48:40,351 INFO L444 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-25 08:48:40,351 INFO L444 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-11-25 08:48:40,351 INFO L444 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-25 08:48:40,351 INFO L447 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-11-25 08:48:40,351 INFO L444 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-11-25 08:48:40,351 INFO L444 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-11-25 08:48:40,352 INFO L440 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (or (not (<= |rec1_#in~i| 2147483647)) (and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))) [2019-11-25 08:48:40,352 INFO L444 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-11-25 08:48:40,352 INFO L444 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-11-25 08:48:40,352 INFO L444 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-25 08:48:40,352 INFO L444 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-11-25 08:48:40,352 INFO L440 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (let ((.cse0 (not (<= |rec1_#in~i| 2147483647)))) (and (or .cse0 (= |rec1_#in~i| rec1_~i)) (or .cse0 (and (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i))))) [2019-11-25 08:48:40,352 INFO L444 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-25 08:48:40,353 INFO L444 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-25 08:48:40,353 INFO L444 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-11-25 08:48:40,353 INFO L444 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-25 08:48:40,353 INFO L440 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (let ((.cse0 (not (<= |rec1_#in~i| 2147483647)))) (and (or (and (<= |rec1_#t~ret1| 0) (<= 1 rec1_~i)) .cse0) (or (and (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1)) .cse0))) [2019-11-25 08:48:40,353 INFO L444 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-11-25 08:48:40,353 INFO L444 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-11-25 08:48:40,353 INFO L444 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-11-25 08:48:40,353 INFO L444 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-25 08:48:40,353 INFO L444 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-11-25 08:48:40,353 INFO L444 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-11-25 08:48:40,354 INFO L440 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-11-25 08:48:40,354 INFO L444 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-25 08:48:40,354 INFO L444 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-11-25 08:48:40,354 INFO L444 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2019-11-25 08:48:40,354 INFO L444 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-25 08:48:40,354 INFO L440 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= |rec2_#t~ret3| 1) (<= 1 rec2_~j) (<= 1 |rec2_#t~ret3|)) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-11-25 08:48:40,354 INFO L444 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-25 08:48:40,354 INFO L444 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-11-25 08:48:40,354 INFO L444 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-25 08:48:40,354 INFO L447 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-11-25 08:48:40,354 INFO L444 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-25 08:48:40,355 INFO L444 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-25 08:48:40,355 INFO L444 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-25 08:48:40,355 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:48:40,355 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:48:40,355 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:48:40,355 INFO L440 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-25 08:48:40,355 INFO L444 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-11-25 08:48:40,355 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-11-25 08:48:40,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:48:40 BoogieIcfgContainer [2019-11-25 08:48:40,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:48:40,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:48:40,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:48:40,360 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:48:40,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:35" (3/4) ... [2019-11-25 08:48:40,363 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:48:40,369 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-11-25 08:48:40,369 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-11-25 08:48:40,380 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-25 08:48:40,380 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:48:40,441 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_75d050ca-7cf4-4da2-bf79-1d601c61faa3/bin/uautomizer/witness.graphml [2019-11-25 08:48:40,441 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:48:40,442 INFO L168 Benchmark]: Toolchain (without parser) took 5243.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 952.8 MB in the beginning and 877.5 MB in the end (delta: 75.3 MB). Peak memory consumption was 220.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:40,443 INFO L168 Benchmark]: CDTParser took 0.22 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-25 08:48:40,443 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 952.8 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:40,443 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.16 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-25 08:48:40,450 INFO L168 Benchmark]: Boogie Preprocessor took 15.12 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-25 08:48:40,450 INFO L168 Benchmark]: RCFGBuilder took 392.60 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-25 08:48:40,451 INFO L168 Benchmark]: TraceAbstraction took 4482.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.3 MB in the end (delta: 232.0 MB). Peak memory consumption was 232.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:40,451 INFO L168 Benchmark]: Witness Printer took 81.82 ms. Allocated memory is still 1.2 GB. Free memory was 884.3 MB in the beginning and 877.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:40,453 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.22 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 236.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 952.8 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.16 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. * Boogie Preprocessor took 15.12 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. * RCFGBuilder took 392.60 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 4482.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.3 MB in the end (delta: 232.0 MB). Peak memory consumption was 232.0 MB. Max. memory is 11.5 GB. * Witness Printer took 81.82 ms. Allocated memory is still 1.2 GB. Free memory was 884.3 MB in the beginning and 877.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 10 error locations. Result: SAFE, OverallTime: 4.4s, OverallIterations: 18, TraceHistogramMax: 10, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 687 SDtfs, 232 SDslu, 1730 SDs, 0 SdLazy, 623 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 89 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 225 PreInvPairs, 234 NumberOfFragments, 103 HoareAnnotationTreeSize, 225 FomulaSimplifications, 618 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 217 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 49059 SizeOfPredicates, 6 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 688/756 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...