./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c -s /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cb528549fa76ae8087cf7043645dfa20323a0116 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:45,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:45,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:45,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:45,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:45,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:45,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:45,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:45,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:45,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:45,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:45,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:45,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:45,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:45,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:45,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:45,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:45,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:45,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:45,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:45,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:45,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:45,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:45,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:45,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:45,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:45,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:45,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:45,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:45,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:45,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:45,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:45,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:45,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:45,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:45,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:45,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:45,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:45,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:45,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:45,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:45,189 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-10-22 08:54:45,200 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:45,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:45,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:45,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:45,202 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:45,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:45,207 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:45,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:45,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:45,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:54:45,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:54:45,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:54:45,208 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-10-22 08:54:45,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:45,208 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:45,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:54:45,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:45,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:45,209 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:54:45,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:54:45,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:54:45,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:45,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:54:45,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:54:45,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:45,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:54:45,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:54:45,211 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb528549fa76ae8087cf7043645dfa20323a0116 [2019-10-22 08:54:45,244 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:45,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:45,258 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:45,259 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:45,260 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:45,260 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-10-22 08:54:45,304 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/data/878464fb0/ef9fe2acd4f04f0e82a9f7f8e4943c9b/FLAG8f5ec4994 [2019-10-22 08:54:45,721 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:45,722 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-10-22 08:54:45,729 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/data/878464fb0/ef9fe2acd4f04f0e82a9f7f8e4943c9b/FLAG8f5ec4994 [2019-10-22 08:54:46,118 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/data/878464fb0/ef9fe2acd4f04f0e82a9f7f8e4943c9b [2019-10-22 08:54:46,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:46,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:46,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:46,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:46,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:46,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:46" (1/1) ... [2019-10-22 08:54:46,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405d99ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:46, skipping insertion in model container [2019-10-22 08:54:46,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:46" (1/1) ... [2019-10-22 08:54:46,136 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:46,149 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:46,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:46,285 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:46,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:46,370 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:46,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:46 WrapperNode [2019-10-22 08:54:46,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:46,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:46,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:46,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:46,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:46" (1/1) ... [2019-10-22 08:54:46,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:46" (1/1) ... [2019-10-22 08:54:46,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:46,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:46,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:46,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:46,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:46" (1/1) ... [2019-10-22 08:54:46,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:46" (1/1) ... [2019-10-22 08:54:46,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:46" (1/1) ... [2019-10-22 08:54:46,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:46" (1/1) ... [2019-10-22 08:54:46,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:46" (1/1) ... [2019-10-22 08:54:46,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:46" (1/1) ... [2019-10-22 08:54:46,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:46" (1/1) ... [2019-10-22 08:54:46,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:46,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:46,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:46,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:46,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:54:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-10-22 08:54:46,480 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-10-22 08:54:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-10-22 08:54:46,480 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-10-22 08:54:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:46,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:46,662 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:46,662 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-22 08:54:46,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:46 BoogieIcfgContainer [2019-10-22 08:54:46,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:46,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:54:46,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:54:46,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:54:46,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:54:46" (1/3) ... [2019-10-22 08:54:46,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3191831d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:46, skipping insertion in model container [2019-10-22 08:54:46,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:46" (2/3) ... [2019-10-22 08:54:46,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3191831d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:46, skipping insertion in model container [2019-10-22 08:54:46,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:46" (3/3) ... [2019-10-22 08:54:46,671 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b.c [2019-10-22 08:54:46,681 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:54:46,700 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-10-22 08:54:46,709 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-10-22 08:54:46,757 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:54:46,757 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:54:46,757 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:54:46,757 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:46,757 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:46,757 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:54:46,757 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:46,757 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:54:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-10-22 08:54:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-10-22 08:54:46,780 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:46,781 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:46,782 INFO L410 AbstractCegarLoop]: === Iteration 1 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:46,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,787 INFO L82 PathProgramCache]: Analyzing trace with hash 70122184, now seen corresponding path program 1 times [2019-10-22 08:54:46,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654505782] [2019-10-22 08:54:46,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:46,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654505782] [2019-10-22 08:54:46,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:46,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:46,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177708551] [2019-10-22 08:54:46,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:54:46,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:46,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:46,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:46,934 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2019-10-22 08:54:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:47,025 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-22 08:54:47,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:47,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-10-22 08:54:47,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:47,037 INFO L225 Difference]: With dead ends: 62 [2019-10-22 08:54:47,037 INFO L226 Difference]: Without dead ends: 55 [2019-10-22 08:54:47,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-22 08:54:47,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2019-10-22 08:54:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-22 08:54:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-10-22 08:54:47,085 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-10-22 08:54:47,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:47,085 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-10-22 08:54:47,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:54:47,086 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-10-22 08:54:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 08:54:47,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:47,086 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:47,087 INFO L410 AbstractCegarLoop]: === Iteration 2 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:47,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2121179530, now seen corresponding path program 1 times [2019-10-22 08:54:47,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143070855] [2019-10-22 08:54:47,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:47,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143070855] [2019-10-22 08:54:47,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:47,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:47,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794498755] [2019-10-22 08:54:47,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:47,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:47,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:47,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:47,109 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-10-22 08:54:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:47,125 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-10-22 08:54:47,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:47,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-10-22 08:54:47,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:47,126 INFO L225 Difference]: With dead ends: 52 [2019-10-22 08:54:47,126 INFO L226 Difference]: Without dead ends: 51 [2019-10-22 08:54:47,127 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-22 08:54:47,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-10-22 08:54:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-22 08:54:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-10-22 08:54:47,136 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 6 [2019-10-22 08:54:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:47,137 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-10-22 08:54:47,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-10-22 08:54:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 08:54:47,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:47,138 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:47,138 INFO L410 AbstractCegarLoop]: === Iteration 3 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:47,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2074588191, now seen corresponding path program 1 times [2019-10-22 08:54:47,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518501677] [2019-10-22 08:54:47,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:47,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518501677] [2019-10-22 08:54:47,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:47,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:47,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883878655] [2019-10-22 08:54:47,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:54:47,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:47,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:47,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:47,193 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 7 states. [2019-10-22 08:54:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:47,374 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2019-10-22 08:54:47,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:54:47,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-10-22 08:54:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:47,376 INFO L225 Difference]: With dead ends: 77 [2019-10-22 08:54:47,376 INFO L226 Difference]: Without dead ends: 76 [2019-10-22 08:54:47,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:54:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-22 08:54:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-10-22 08:54:47,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-22 08:54:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2019-10-22 08:54:47,399 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 10 [2019-10-22 08:54:47,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:47,400 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2019-10-22 08:54:47,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:54:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2019-10-22 08:54:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 08:54:47,400 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:47,400 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:47,401 INFO L410 AbstractCegarLoop]: === Iteration 4 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:47,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,401 INFO L82 PathProgramCache]: Analyzing trace with hash 112275557, now seen corresponding path program 1 times [2019-10-22 08:54:47,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236660669] [2019-10-22 08:54:47,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:47,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236660669] [2019-10-22 08:54:47,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:47,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:47,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67682815] [2019-10-22 08:54:47,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:47,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:47,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:47,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:47,431 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand 3 states. [2019-10-22 08:54:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:47,455 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2019-10-22 08:54:47,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:47,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 08:54:47,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:47,458 INFO L225 Difference]: With dead ends: 69 [2019-10-22 08:54:47,458 INFO L226 Difference]: Without dead ends: 68 [2019-10-22 08:54:47,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-22 08:54:47,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-10-22 08:54:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-22 08:54:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-10-22 08:54:47,473 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 11 [2019-10-22 08:54:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:47,474 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-10-22 08:54:47,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-10-22 08:54:47,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:54:47,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:47,475 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:47,475 INFO L410 AbstractCegarLoop]: === Iteration 5 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:47,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2048531074, now seen corresponding path program 1 times [2019-10-22 08:54:47,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881395592] [2019-10-22 08:54:47,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:47,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881395592] [2019-10-22 08:54:47,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:47,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:47,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504724047] [2019-10-22 08:54:47,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:47,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:47,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:47,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:47,525 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 6 states. [2019-10-22 08:54:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:47,568 INFO L93 Difference]: Finished difference Result 125 states and 160 transitions. [2019-10-22 08:54:47,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:47,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 08:54:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:47,569 INFO L225 Difference]: With dead ends: 125 [2019-10-22 08:54:47,570 INFO L226 Difference]: Without dead ends: 86 [2019-10-22 08:54:47,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:47,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-22 08:54:47,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-10-22 08:54:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-22 08:54:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-10-22 08:54:47,582 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 16 [2019-10-22 08:54:47,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:47,583 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-10-22 08:54:47,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-10-22 08:54:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:54:47,584 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:47,584 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:47,584 INFO L410 AbstractCegarLoop]: === Iteration 6 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash -57180086, now seen corresponding path program 1 times [2019-10-22 08:54:47,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937296554] [2019-10-22 08:54:47,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:47,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937296554] [2019-10-22 08:54:47,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:47,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:47,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146191996] [2019-10-22 08:54:47,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:47,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:47,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:47,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:47,618 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 3 states. [2019-10-22 08:54:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:47,629 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2019-10-22 08:54:47,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:47,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 08:54:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:47,631 INFO L225 Difference]: With dead ends: 76 [2019-10-22 08:54:47,631 INFO L226 Difference]: Without dead ends: 75 [2019-10-22 08:54:47,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-22 08:54:47,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-22 08:54:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 08:54:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2019-10-22 08:54:47,642 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 18 [2019-10-22 08:54:47,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:47,642 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2019-10-22 08:54:47,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2019-10-22 08:54:47,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 08:54:47,643 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:47,643 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:47,644 INFO L410 AbstractCegarLoop]: === Iteration 7 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:47,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,644 INFO L82 PathProgramCache]: Analyzing trace with hash -599425808, now seen corresponding path program 1 times [2019-10-22 08:54:47,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123800155] [2019-10-22 08:54:47,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:47,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123800155] [2019-10-22 08:54:47,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:47,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:47,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192041541] [2019-10-22 08:54:47,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:47,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:47,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:47,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:47,668 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand 3 states. [2019-10-22 08:54:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:47,683 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2019-10-22 08:54:47,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:47,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 08:54:47,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:47,687 INFO L225 Difference]: With dead ends: 75 [2019-10-22 08:54:47,688 INFO L226 Difference]: Without dead ends: 74 [2019-10-22 08:54:47,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-22 08:54:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-22 08:54:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 08:54:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-10-22 08:54:47,705 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 19 [2019-10-22 08:54:47,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:47,705 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-10-22 08:54:47,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-10-22 08:54:47,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 08:54:47,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:47,706 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:47,706 INFO L410 AbstractCegarLoop]: === Iteration 8 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:47,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1772582622, now seen corresponding path program 1 times [2019-10-22 08:54:47,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478203506] [2019-10-22 08:54:47,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:47,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478203506] [2019-10-22 08:54:47,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:47,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:47,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515369882] [2019-10-22 08:54:47,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:47,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:47,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:47,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:47,761 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 4 states. [2019-10-22 08:54:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:47,796 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2019-10-22 08:54:47,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:47,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-22 08:54:47,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:47,799 INFO L225 Difference]: With dead ends: 95 [2019-10-22 08:54:47,799 INFO L226 Difference]: Without dead ends: 94 [2019-10-22 08:54:47,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-22 08:54:47,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2019-10-22 08:54:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-22 08:54:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-10-22 08:54:47,818 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 19 [2019-10-22 08:54:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:47,823 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-10-22 08:54:47,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-10-22 08:54:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 08:54:47,823 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:47,823 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:47,824 INFO L410 AbstractCegarLoop]: === Iteration 9 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:47,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1402330794, now seen corresponding path program 1 times [2019-10-22 08:54:47,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725231051] [2019-10-22 08:54:47,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:47,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725231051] [2019-10-22 08:54:47,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:47,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:47,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675082875] [2019-10-22 08:54:47,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:47,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:47,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:47,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:47,872 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 4 states. [2019-10-22 08:54:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:47,887 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-10-22 08:54:47,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:47,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-22 08:54:47,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:47,889 INFO L225 Difference]: With dead ends: 89 [2019-10-22 08:54:47,889 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 08:54:47,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 08:54:47,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-10-22 08:54:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-22 08:54:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-10-22 08:54:47,898 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 20 [2019-10-22 08:54:47,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:47,898 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-10-22 08:54:47,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-10-22 08:54:47,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:54:47,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:47,899 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:47,899 INFO L410 AbstractCegarLoop]: === Iteration 10 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:47,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,900 INFO L82 PathProgramCache]: Analyzing trace with hash 921726737, now seen corresponding path program 1 times [2019-10-22 08:54:47,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928674856] [2019-10-22 08:54:47,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:54:47,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928674856] [2019-10-22 08:54:47,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:47,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:47,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48048110] [2019-10-22 08:54:47,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:47,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:47,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:47,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:47,939 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 6 states. [2019-10-22 08:54:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:47,999 INFO L93 Difference]: Finished difference Result 167 states and 222 transitions. [2019-10-22 08:54:47,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:48,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-22 08:54:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:48,001 INFO L225 Difference]: With dead ends: 167 [2019-10-22 08:54:48,001 INFO L226 Difference]: Without dead ends: 101 [2019-10-22 08:54:48,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:54:48,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-22 08:54:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2019-10-22 08:54:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 08:54:48,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-10-22 08:54:48,011 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 23 [2019-10-22 08:54:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:48,012 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-10-22 08:54:48,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:48,012 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-10-22 08:54:48,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 08:54:48,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:48,013 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:48,013 INFO L410 AbstractCegarLoop]: === Iteration 11 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:48,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,013 INFO L82 PathProgramCache]: Analyzing trace with hash 970950199, now seen corresponding path program 1 times [2019-10-22 08:54:48,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773521993] [2019-10-22 08:54:48,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 08:54:48,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773521993] [2019-10-22 08:54:48,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:48,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:48,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35720594] [2019-10-22 08:54:48,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:48,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:48,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:48,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:48,058 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-10-22 08:54:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:48,112 INFO L93 Difference]: Finished difference Result 176 states and 226 transitions. [2019-10-22 08:54:48,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:48,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-10-22 08:54:48,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:48,113 INFO L225 Difference]: With dead ends: 176 [2019-10-22 08:54:48,114 INFO L226 Difference]: Without dead ends: 105 [2019-10-22 08:54:48,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:54:48,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-22 08:54:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-10-22 08:54:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-22 08:54:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2019-10-22 08:54:48,124 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 34 [2019-10-22 08:54:48,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:48,124 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2019-10-22 08:54:48,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:48,124 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2019-10-22 08:54:48,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 08:54:48,125 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:48,125 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:48,125 INFO L410 AbstractCegarLoop]: === Iteration 12 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:48,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1027694963, now seen corresponding path program 1 times [2019-10-22 08:54:48,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807768861] [2019-10-22 08:54:48,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,165 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 08:54:48,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807768861] [2019-10-22 08:54:48,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:48,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:48,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561531729] [2019-10-22 08:54:48,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:48,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:48,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:48,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:48,167 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 4 states. [2019-10-22 08:54:48,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:48,185 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2019-10-22 08:54:48,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:48,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-22 08:54:48,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:48,188 INFO L225 Difference]: With dead ends: 104 [2019-10-22 08:54:48,188 INFO L226 Difference]: Without dead ends: 103 [2019-10-22 08:54:48,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:48,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-22 08:54:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-10-22 08:54:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-22 08:54:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2019-10-22 08:54:48,200 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 37 [2019-10-22 08:54:48,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:48,200 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2019-10-22 08:54:48,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2019-10-22 08:54:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-22 08:54:48,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:48,202 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:48,202 INFO L410 AbstractCegarLoop]: === Iteration 13 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:48,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1793772729, now seen corresponding path program 1 times [2019-10-22 08:54:48,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341152513] [2019-10-22 08:54:48,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-22 08:54:48,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341152513] [2019-10-22 08:54:48,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:48,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:48,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581823662] [2019-10-22 08:54:48,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:48,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:48,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:48,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:48,237 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 3 states. [2019-10-22 08:54:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:48,256 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2019-10-22 08:54:48,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:48,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-22 08:54:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:48,258 INFO L225 Difference]: With dead ends: 101 [2019-10-22 08:54:48,258 INFO L226 Difference]: Without dead ends: 100 [2019-10-22 08:54:48,259 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-22 08:54:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-10-22 08:54:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-22 08:54:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2019-10-22 08:54:48,273 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 38 [2019-10-22 08:54:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:48,274 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2019-10-22 08:54:48,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2019-10-22 08:54:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 08:54:48,279 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:48,280 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:48,280 INFO L410 AbstractCegarLoop]: === Iteration 14 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:48,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,280 INFO L82 PathProgramCache]: Analyzing trace with hash -747989016, now seen corresponding path program 1 times [2019-10-22 08:54:48,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986504101] [2019-10-22 08:54:48,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 08:54:48,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986504101] [2019-10-22 08:54:48,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:48,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:48,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484309013] [2019-10-22 08:54:48,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:48,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:48,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:48,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:48,404 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 6 states. [2019-10-22 08:54:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:48,459 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2019-10-22 08:54:48,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:48,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-10-22 08:54:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:48,461 INFO L225 Difference]: With dead ends: 110 [2019-10-22 08:54:48,461 INFO L226 Difference]: Without dead ends: 109 [2019-10-22 08:54:48,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-22 08:54:48,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2019-10-22 08:54:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-22 08:54:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-10-22 08:54:48,475 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 43 [2019-10-22 08:54:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:48,477 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-10-22 08:54:48,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:48,478 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-10-22 08:54:48,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-22 08:54:48,479 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:48,479 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:48,480 INFO L410 AbstractCegarLoop]: === Iteration 15 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:48,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1488967228, now seen corresponding path program 1 times [2019-10-22 08:54:48,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212045693] [2019-10-22 08:54:48,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-22 08:54:48,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212045693] [2019-10-22 08:54:48,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423709493] [2019-10-22 08:54:48,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:48,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-22 08:54:48,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:48,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-10-22 08:54:48,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979631135] [2019-10-22 08:54:48,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:54:48,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:48,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:48,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:54:48,753 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 7 states. [2019-10-22 08:54:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:48,859 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2019-10-22 08:54:48,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:54:48,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-10-22 08:54:48,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:48,861 INFO L225 Difference]: With dead ends: 100 [2019-10-22 08:54:48,861 INFO L226 Difference]: Without dead ends: 99 [2019-10-22 08:54:48,862 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:54:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-22 08:54:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-10-22 08:54:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-22 08:54:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2019-10-22 08:54:48,881 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 40 [2019-10-22 08:54:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:48,881 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2019-10-22 08:54:48,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:54:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2019-10-22 08:54:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 08:54:48,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:48,892 INFO L380 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:49,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:49,093 INFO L410 AbstractCegarLoop]: === Iteration 16 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:49,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1798417111, now seen corresponding path program 1 times [2019-10-22 08:54:49,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824695772] [2019-10-22 08:54:49,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 08:54:49,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824695772] [2019-10-22 08:54:49,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776831714] [2019-10-22 08:54:49,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:49,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-22 08:54:49,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:49,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-10-22 08:54:49,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076203514] [2019-10-22 08:54:49,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:54:49,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:49,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:54:49,269 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 7 states. [2019-10-22 08:54:49,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,413 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2019-10-22 08:54:49,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:54:49,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-10-22 08:54:49,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:49,414 INFO L225 Difference]: With dead ends: 126 [2019-10-22 08:54:49,414 INFO L226 Difference]: Without dead ends: 125 [2019-10-22 08:54:49,415 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-10-22 08:54:49,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-22 08:54:49,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-10-22 08:54:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-22 08:54:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2019-10-22 08:54:49,423 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 47 [2019-10-22 08:54:49,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:49,423 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2019-10-22 08:54:49,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:54:49,423 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2019-10-22 08:54:49,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 08:54:49,424 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:49,424 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:49,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:49,625 INFO L410 AbstractCegarLoop]: === Iteration 17 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:49,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,625 INFO L82 PathProgramCache]: Analyzing trace with hash 695736933, now seen corresponding path program 1 times [2019-10-22 08:54:49,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997390068] [2019-10-22 08:54:49,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-22 08:54:49,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997390068] [2019-10-22 08:54:49,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862579463] [2019-10-22 08:54:49,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:49,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-22 08:54:49,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:49,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2019-10-22 08:54:49,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972755626] [2019-10-22 08:54:49,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:54:49,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:49,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:54:49,782 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand 5 states. [2019-10-22 08:54:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,834 INFO L93 Difference]: Finished difference Result 152 states and 185 transitions. [2019-10-22 08:54:49,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:49,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-22 08:54:49,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:49,835 INFO L225 Difference]: With dead ends: 152 [2019-10-22 08:54:49,835 INFO L226 Difference]: Without dead ends: 151 [2019-10-22 08:54:49,836 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:54:49,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-22 08:54:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-10-22 08:54:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-22 08:54:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 184 transitions. [2019-10-22 08:54:49,845 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 184 transitions. Word has length 45 [2019-10-22 08:54:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:49,846 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 184 transitions. [2019-10-22 08:54:49,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:54:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2019-10-22 08:54:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-22 08:54:49,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:49,847 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:50,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:50,049 INFO L410 AbstractCegarLoop]: === Iteration 18 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1252678887, now seen corresponding path program 1 times [2019-10-22 08:54:50,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:50,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853139363] [2019-10-22 08:54:50,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-22 08:54:50,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853139363] [2019-10-22 08:54:50,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379281227] [2019-10-22 08:54:50,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:50,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-22 08:54:50,139 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:50,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-10-22 08:54:50,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086414694] [2019-10-22 08:54:50,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:50,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:50,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:50,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:50,140 INFO L87 Difference]: Start difference. First operand 150 states and 184 transitions. Second operand 6 states. [2019-10-22 08:54:50,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:50,192 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2019-10-22 08:54:50,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:50,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-22 08:54:50,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:50,194 INFO L225 Difference]: With dead ends: 159 [2019-10-22 08:54:50,194 INFO L226 Difference]: Without dead ends: 155 [2019-10-22 08:54:50,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:50,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-22 08:54:50,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-10-22 08:54:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-22 08:54:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 189 transitions. [2019-10-22 08:54:50,204 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 189 transitions. Word has length 60 [2019-10-22 08:54:50,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:50,204 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 189 transitions. [2019-10-22 08:54:50,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:50,204 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 189 transitions. [2019-10-22 08:54:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-22 08:54:50,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:50,205 INFO L380 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, 1, 1] [2019-10-22 08:54:50,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:50,406 INFO L410 AbstractCegarLoop]: === Iteration 19 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:50,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1438531096, now seen corresponding path program 2 times [2019-10-22 08:54:50,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:50,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986317366] [2019-10-22 08:54:50,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 60 proven. 32 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-22 08:54:50,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986317366] [2019-10-22 08:54:50,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562166536] [2019-10-22 08:54:50,545 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:50,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:54:50,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:54:50,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:54:50,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-22 08:54:50,622 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:50,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2019-10-22 08:54:50,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298347869] [2019-10-22 08:54:50,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-22 08:54:50,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:50,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 08:54:50,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:54:50,624 INFO L87 Difference]: Start difference. First operand 155 states and 189 transitions. Second operand 13 states. [2019-10-22 08:54:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:50,809 INFO L93 Difference]: Finished difference Result 234 states and 284 transitions. [2019-10-22 08:54:50,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:54:50,810 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-10-22 08:54:50,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:50,810 INFO L225 Difference]: With dead ends: 234 [2019-10-22 08:54:50,811 INFO L226 Difference]: Without dead ends: 97 [2019-10-22 08:54:50,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-10-22 08:54:50,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-22 08:54:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2019-10-22 08:54:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-22 08:54:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-10-22 08:54:50,817 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 77 [2019-10-22 08:54:50,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:50,817 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-10-22 08:54:50,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-22 08:54:50,817 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-10-22 08:54:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-22 08:54:50,818 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:50,819 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-10-22 08:54:51,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:51,019 INFO L410 AbstractCegarLoop]: === Iteration 20 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:54:51,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,020 INFO L82 PathProgramCache]: Analyzing trace with hash -151262980, now seen corresponding path program 2 times [2019-10-22 08:54:51,020 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137095076] [2019-10-22 08:54:51,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 73 proven. 96 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-10-22 08:54:51,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137095076] [2019-10-22 08:54:51,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944583572] [2019-10-22 08:54:51,339 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:51,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:54:51,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:54:51,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:54:51,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 48 proven. 78 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-10-22 08:54:51,475 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:51,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 23 [2019-10-22 08:54:51,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165934564] [2019-10-22 08:54:51,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-22 08:54:51,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:51,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-22 08:54:51,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-10-22 08:54:51,477 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 23 states. [2019-10-22 08:54:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:51,806 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-10-22 08:54:51,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:54:51,806 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 124 [2019-10-22 08:54:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:51,807 INFO L225 Difference]: With dead ends: 95 [2019-10-22 08:54:51,807 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:54:51,807 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2019-10-22 08:54:51,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:54:51,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:54:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:54:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:54:51,808 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2019-10-22 08:54:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:51,808 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:51,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-22 08:54:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:51,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:54:52,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:52,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:54:52,238 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2019-10-22 08:54:52,367 INFO L443 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-10-22 08:54:52,367 INFO L443 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-10-22 08:54:52,367 INFO L443 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-10-22 08:54:52,367 INFO L443 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-10-22 08:54:52,367 INFO L443 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-10-22 08:54:52,367 INFO L446 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-10-22 08:54:52,367 INFO L443 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-10-22 08:54:52,367 INFO L443 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-10-22 08:54:52,368 INFO L439 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (and (or (= |rec1_#in~i| rec1_~i) (not (<= |rec1_#in~i| 2147483647))) (not (<= |rec1_#in~i| 0))) [2019-10-22 08:54:52,368 INFO L443 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-10-22 08:54:52,368 INFO L443 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-10-22 08:54:52,368 INFO L443 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-10-22 08:54:52,368 INFO L439 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (and (or (not (<= |rec1_#in~i| 2147483647)) (and (<= |rec1_#t~ret0| 1) (= |rec1_#in~i| rec1_~i))) (not (<= |rec1_#in~i| 0))) [2019-10-22 08:54:52,368 INFO L443 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-10-22 08:54:52,368 INFO L439 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (and (or (not (<= |rec1_#in~i| 2147483647)) (and (<= |rec1_#t~ret1| 0) (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1))) (or (<= 1 rec1_~i) (not (<= |rec1_#in~i| 2147483646)))) [2019-10-22 08:54:52,368 INFO L443 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-10-22 08:54:52,368 INFO L443 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-10-22 08:54:52,368 INFO L443 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-10-22 08:54:52,368 INFO L443 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-10-22 08:54:52,368 INFO L443 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-10-22 08:54:52,369 INFO L443 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-10-22 08:54:52,369 INFO L443 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-10-22 08:54:52,369 INFO L443 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-10-22 08:54:52,369 INFO L443 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-10-22 08:54:52,369 INFO L443 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-10-22 08:54:52,369 INFO L443 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-10-22 08:54:52,369 INFO L443 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-10-22 08:54:52,369 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-10-22 08:54:52,369 INFO L439 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (and (or (= rec2_~j |rec2_#in~j|) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-10-22 08:54:52,369 INFO L443 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-10-22 08:54:52,369 INFO L439 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (let ((.cse0 (not (<= |rec2_#in~j| 2147483647)))) (and (or (= rec2_~j |rec2_#in~j|) .cse0) (or (and (<= |rec2_#t~ret3| 1) (<= (+ |rec2_#t~ret3| 1) |rec2_#in~j|)) .cse0) (not (<= |rec2_#in~j| 0)))) [2019-10-22 08:54:52,369 INFO L443 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-10-22 08:54:52,370 INFO L443 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-10-22 08:54:52,370 INFO L443 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-10-22 08:54:52,370 INFO L446 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-10-22 08:54:52,370 INFO L443 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-10-22 08:54:52,370 INFO L443 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-10-22 08:54:52,370 INFO L443 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-10-22 08:54:52,370 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:54:52,371 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:54:52,371 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:54:52,371 INFO L439 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-10-22 08:54:52,371 INFO L443 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-10-22 08:54:52,372 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-10-22 08:54:52,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:54:52 BoogieIcfgContainer [2019-10-22 08:54:52,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:54:52,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:52,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:52,377 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:52,377 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:46" (3/4) ... [2019-10-22 08:54:52,381 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:54:52,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-10-22 08:54:52,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-10-22 08:54:52,396 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-10-22 08:54:52,396 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:54:52,448 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_56efeb54-3d80-40ff-90d0-28cdd4f32994/bin/uautomizer/witness.graphml [2019-10-22 08:54:52,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:52,452 INFO L168 Benchmark]: Toolchain (without parser) took 6330.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 948.5 MB in the beginning and 933.4 MB in the end (delta: 15.1 MB). Peak memory consumption was 202.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:52,452 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:52,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:52,453 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.48 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-10-22 08:54:52,453 INFO L168 Benchmark]: Boogie Preprocessor took 16.08 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-10-22 08:54:52,453 INFO L168 Benchmark]: RCFGBuilder took 247.28 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-10-22 08:54:52,454 INFO L168 Benchmark]: TraceAbstraction took 5711.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 941.5 MB in the end (delta: 172.7 MB). Peak memory consumption was 222.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:52,454 INFO L168 Benchmark]: Witness Printer took 74.51 ms. Allocated memory is still 1.2 GB. Free memory was 941.5 MB in the beginning and 933.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:52,462 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.48 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 16.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 247.28 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 5711.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 941.5 MB in the end (delta: 172.7 MB). Peak memory consumption was 222.0 MB. Max. memory is 11.5 GB. * Witness Printer took 74.51 ms. Allocated memory is still 1.2 GB. Free memory was 941.5 MB in the beginning and 933.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 10 error locations. Result: SAFE, OverallTime: 5.6s, OverallIterations: 20, TraceHistogramMax: 12, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 761 SDtfs, 319 SDslu, 2125 SDs, 0 SdLazy, 1018 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 653 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 93 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 222 PreInvPairs, 238 NumberOfFragments, 99 HoareAnnotationTreeSize, 222 FomulaSimplifications, 669 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 455 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1085 NumberOfCodeBlocks, 1085 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1059 ConstructedInterpolants, 0 QuantifiedInterpolants, 113911 SizeOfPredicates, 8 NumberOfNonLiveVariables, 811 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 26 InterpolantComputations, 17 PerfectInterpolantSequences, 1277/1527 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...