./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_38d9991d-3e0f-4d1c-a813-11319d066246/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_38d9991d-3e0f-4d1c-a813-11319d066246/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_38d9991d-3e0f-4d1c-a813-11319d066246/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_38d9991d-3e0f-4d1c-a813-11319d066246/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c -s /tmp/vcloud-vcloud-master/worker/run_dir_38d9991d-3e0f-4d1c-a813-11319d066246/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_38d9991d-3e0f-4d1c-a813-11319d066246/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 4c761fb15c9d367876fc9f1553874e9680fa1668 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:47:54,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:47:54,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:47:54,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:47:54,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:47:54,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:47:54,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:47:54,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:47:54,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:47:54,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:47:54,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:47:54,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:47:54,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:47:54,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:47:54,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:47:54,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:47:54,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:47:54,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:47:54,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:47:54,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:47:54,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:47:54,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:47:54,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:47:54,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:47:54,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:47:54,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:47:54,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:47:54,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:47:54,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:47:54,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:47:54,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:47:54,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:47:54,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:47:54,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:47:54,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:47:54,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:47:54,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:47:54,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:47:54,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:47:54,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:47:54,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:47:54,402 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_38d9991d-3e0f-4d1c-a813-11319d066246/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-15 21:47:54,427 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:47:54,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:47:54,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:47:54,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:47:54,428 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:47:54,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:47:54,429 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:47:54,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:47:54,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:47:54,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:47:54,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:47:54,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:47:54,430 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-15 21:47:54,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:47:54,431 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:47:54,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:47:54,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:47:54,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:47:54,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:47:54,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:47:54,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:47:54,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:47:54,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:47:54,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:47:54,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:47:54,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:47:54,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:47:54,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_38d9991d-3e0f-4d1c-a813-11319d066246/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 -> 4c761fb15c9d367876fc9f1553874e9680fa1668 [2019-11-15 21:47:54,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:47:54,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:47:54,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:47:54,491 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:47:54,492 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:47:54,493 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_38d9991d-3e0f-4d1c-a813-11319d066246/bin/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c [2019-11-15 21:47:54,564 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_38d9991d-3e0f-4d1c-a813-11319d066246/bin/uautomizer/data/8c9f07c60/4273a39a9e724b85849a104509bed939/FLAGc49b310fd [2019-11-15 21:47:54,883 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:47:54,884 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_38d9991d-3e0f-4d1c-a813-11319d066246/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c [2019-11-15 21:47:54,889 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_38d9991d-3e0f-4d1c-a813-11319d066246/bin/uautomizer/data/8c9f07c60/4273a39a9e724b85849a104509bed939/FLAGc49b310fd [2019-11-15 21:47:55,273 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_38d9991d-3e0f-4d1c-a813-11319d066246/bin/uautomizer/data/8c9f07c60/4273a39a9e724b85849a104509bed939 [2019-11-15 21:47:55,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:47:55,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:47:55,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:47:55,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:47:55,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:47:55,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:47:55" (1/1) ... [2019-11-15 21:47:55,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7c4fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:47:55, skipping insertion in model container [2019-11-15 21:47:55,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:47:55" (1/1) ... [2019-11-15 21:47:55,291 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:47:55,306 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:47:55,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:47:55,491 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:47:55,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:47:55,620 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:47:55,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:47:55 WrapperNode [2019-11-15 21:47:55,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:47:55,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:47:55,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:47:55,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:47:55,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:47:55" (1/1) ... [2019-11-15 21:47:55,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:47:55" (1/1) ... [2019-11-15 21:47:55,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:47:55,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:47:55,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:47:55,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:47:55,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:47:55" (1/1) ... [2019-11-15 21:47:55,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:47:55" (1/1) ... [2019-11-15 21:47:55,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:47:55" (1/1) ... [2019-11-15 21:47:55,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:47:55" (1/1) ... [2019-11-15 21:47:55,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:47:55" (1/1) ... [2019-11-15 21:47:55,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:47:55" (1/1) ... [2019-11-15 21:47:55,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:47:55" (1/1) ... [2019-11-15 21:47:55,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:47:55,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:47:55,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:47:55,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:47:55,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:47:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_38d9991d-3e0f-4d1c-a813-11319d066246/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:47:55,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:47:55,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:47:55,946 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:47:55,946 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 21:47:55,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:47:55 BoogieIcfgContainer [2019-11-15 21:47:55,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:47:55,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:47:55,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:47:55,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:47:55,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:47:55" (1/3) ... [2019-11-15 21:47:55,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f12e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:47:55, skipping insertion in model container [2019-11-15 21:47:55,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:47:55" (2/3) ... [2019-11-15 21:47:55,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f12e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:47:55, skipping insertion in model container [2019-11-15 21:47:55,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:47:55" (3/3) ... [2019-11-15 21:47:55,968 INFO L109 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-wise.c [2019-11-15 21:47:55,977 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:47:55,990 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-15 21:47:55,999 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-15 21:47:56,023 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:47:56,023 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:47:56,023 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:47:56,023 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:47:56,024 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:47:56,024 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:47:56,024 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:47:56,024 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:47:56,039 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-15 21:47:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-15 21:47:56,045 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:56,046 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-15 21:47:56,047 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:47:56,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:56,052 INFO L82 PathProgramCache]: Analyzing trace with hash 30885, now seen corresponding path program 1 times [2019-11-15 21:47:56,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:56,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237266069] [2019-11-15 21:47:56,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:56,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:56,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:47:56,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237266069] [2019-11-15 21:47:56,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:56,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:47:56,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979034636] [2019-11-15 21:47:56,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:47:56,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:56,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:47:56,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:47:56,207 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2019-11-15 21:47:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:56,341 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2019-11-15 21:47:56,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:47:56,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-11-15 21:47:56,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:56,351 INFO L225 Difference]: With dead ends: 53 [2019-11-15 21:47:56,352 INFO L226 Difference]: Without dead ends: 35 [2019-11-15 21:47:56,354 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:47:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-15 21:47:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2019-11-15 21:47:56,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 21:47:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-11-15 21:47:56,387 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 3 [2019-11-15 21:47:56,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:56,387 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-15 21:47:56,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:47:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-11-15 21:47:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-15 21:47:56,388 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:56,388 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-15 21:47:56,388 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:47:56,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:56,389 INFO L82 PathProgramCache]: Analyzing trace with hash 957477, now seen corresponding path program 1 times [2019-11-15 21:47:56,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:56,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117587179] [2019-11-15 21:47:56,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:56,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:56,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:47:56,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117587179] [2019-11-15 21:47:56,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:56,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:47:56,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020175857] [2019-11-15 21:47:56,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:47:56,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:56,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:47:56,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:47:56,426 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 4 states. [2019-11-15 21:47:56,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:56,535 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-11-15 21:47:56,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:47:56,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-11-15 21:47:56,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:56,537 INFO L225 Difference]: With dead ends: 47 [2019-11-15 21:47:56,537 INFO L226 Difference]: Without dead ends: 45 [2019-11-15 21:47:56,538 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:47:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-15 21:47:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2019-11-15 21:47:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 21:47:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-15 21:47:56,544 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 4 [2019-11-15 21:47:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:56,545 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-15 21:47:56,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:47:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-15 21:47:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-15 21:47:56,546 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:56,546 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:47:56,546 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:47:56,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:56,546 INFO L82 PathProgramCache]: Analyzing trace with hash -511748973, now seen corresponding path program 1 times [2019-11-15 21:47:56,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:56,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976794065] [2019-11-15 21:47:56,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:56,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:56,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:47:56,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976794065] [2019-11-15 21:47:56,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:56,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:47:56,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214504272] [2019-11-15 21:47:56,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:47:56,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:56,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:47:56,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:47:56,608 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2019-11-15 21:47:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:56,755 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2019-11-15 21:47:56,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:47:56,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-11-15 21:47:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:56,757 INFO L225 Difference]: With dead ends: 79 [2019-11-15 21:47:56,757 INFO L226 Difference]: Without dead ends: 78 [2019-11-15 21:47:56,758 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:47:56,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-15 21:47:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2019-11-15 21:47:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-15 21:47:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2019-11-15 21:47:56,778 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 8 [2019-11-15 21:47:56,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:56,778 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2019-11-15 21:47:56,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:47:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2019-11-15 21:47:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-15 21:47:56,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:56,779 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:47:56,779 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:47:56,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:56,780 INFO L82 PathProgramCache]: Analyzing trace with hash -511749165, now seen corresponding path program 1 times [2019-11-15 21:47:56,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:56,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867688035] [2019-11-15 21:47:56,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:56,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:56,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:47:56,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867688035] [2019-11-15 21:47:56,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:56,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:47:56,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632373798] [2019-11-15 21:47:56,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:47:56,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:56,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:47:56,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:47:56,823 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand 4 states. [2019-11-15 21:47:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:56,881 INFO L93 Difference]: Finished difference Result 96 states and 130 transitions. [2019-11-15 21:47:56,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:47:56,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-15 21:47:56,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:56,883 INFO L225 Difference]: With dead ends: 96 [2019-11-15 21:47:56,884 INFO L226 Difference]: Without dead ends: 51 [2019-11-15 21:47:56,884 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:47:56,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-15 21:47:56,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2019-11-15 21:47:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 21:47:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-11-15 21:47:56,890 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 8 [2019-11-15 21:47:56,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:56,891 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-15 21:47:56,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:47:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-11-15 21:47:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 21:47:56,892 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:56,892 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:47:56,892 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:47:56,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:56,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1315651091, now seen corresponding path program 1 times [2019-11-15 21:47:56,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:56,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957814096] [2019-11-15 21:47:56,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:56,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:56,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:47:56,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957814096] [2019-11-15 21:47:56,935 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:56,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:47:56,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801628820] [2019-11-15 21:47:56,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:47:56,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:56,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:47:56,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:47:56,937 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 3 states. [2019-11-15 21:47:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:56,968 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-11-15 21:47:56,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:47:56,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-15 21:47:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:56,970 INFO L225 Difference]: With dead ends: 42 [2019-11-15 21:47:56,970 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 21:47:56,971 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:47:56,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 21:47:56,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-15 21:47:56,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 21:47:56,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2019-11-15 21:47:56,976 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 9 [2019-11-15 21:47:56,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:56,982 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-11-15 21:47:56,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:47:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2019-11-15 21:47:56,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 21:47:56,982 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:56,983 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:47:56,983 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:47:56,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:56,984 INFO L82 PathProgramCache]: Analyzing trace with hash -2115076497, now seen corresponding path program 1 times [2019-11-15 21:47:56,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:56,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896983986] [2019-11-15 21:47:56,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:56,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:56,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:47:57,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896983986] [2019-11-15 21:47:57,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:57,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:47:57,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905908946] [2019-11-15 21:47:57,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:47:57,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:57,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:47:57,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:47:57,030 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2019-11-15 21:47:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:57,070 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-11-15 21:47:57,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:47:57,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 21:47:57,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:57,072 INFO L225 Difference]: With dead ends: 75 [2019-11-15 21:47:57,072 INFO L226 Difference]: Without dead ends: 40 [2019-11-15 21:47:57,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:47:57,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-15 21:47:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2019-11-15 21:47:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-15 21:47:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-11-15 21:47:57,077 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 10 [2019-11-15 21:47:57,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:57,077 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-11-15 21:47:57,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:47:57,077 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-11-15 21:47:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 21:47:57,077 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:57,078 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:47:57,078 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:47:57,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:57,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2115076689, now seen corresponding path program 1 times [2019-11-15 21:47:57,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:57,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059672316] [2019-11-15 21:47:57,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:57,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:57,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:47:57,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059672316] [2019-11-15 21:47:57,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:57,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:47:57,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819370175] [2019-11-15 21:47:57,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:47:57,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:57,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:47:57,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:47:57,124 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 5 states. [2019-11-15 21:47:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:57,209 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-15 21:47:57,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:47:57,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 21:47:57,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:57,210 INFO L225 Difference]: With dead ends: 54 [2019-11-15 21:47:57,210 INFO L226 Difference]: Without dead ends: 53 [2019-11-15 21:47:57,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:47:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-15 21:47:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-11-15 21:47:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-15 21:47:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-11-15 21:47:57,216 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 10 [2019-11-15 21:47:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:57,216 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-11-15 21:47:57,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:47:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-11-15 21:47:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 21:47:57,217 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:57,217 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:47:57,218 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:47:57,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:57,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1142867855, now seen corresponding path program 1 times [2019-11-15 21:47:57,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:57,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545542851] [2019-11-15 21:47:57,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:57,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:57,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:47:57,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545542851] [2019-11-15 21:47:57,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:57,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:47:57,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526525531] [2019-11-15 21:47:57,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:47:57,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:57,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:47:57,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:47:57,252 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2019-11-15 21:47:57,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:57,271 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-11-15 21:47:57,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:47:57,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-15 21:47:57,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:57,272 INFO L225 Difference]: With dead ends: 44 [2019-11-15 21:47:57,272 INFO L226 Difference]: Without dead ends: 43 [2019-11-15 21:47:57,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:47:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-15 21:47:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-15 21:47:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 21:47:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-11-15 21:47:57,278 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 11 [2019-11-15 21:47:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:57,278 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-11-15 21:47:57,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:47:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-11-15 21:47:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 21:47:57,279 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:57,279 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:47:57,279 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:47:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1620314709, now seen corresponding path program 1 times [2019-11-15 21:47:57,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:57,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266942879] [2019-11-15 21:47:57,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:57,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:57,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:47:57,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266942879] [2019-11-15 21:47:57,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:57,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:47:57,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872389347] [2019-11-15 21:47:57,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:47:57,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:57,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:47:57,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:47:57,328 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 5 states. [2019-11-15 21:47:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:57,409 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-11-15 21:47:57,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:47:57,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-15 21:47:57,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:57,411 INFO L225 Difference]: With dead ends: 56 [2019-11-15 21:47:57,412 INFO L226 Difference]: Without dead ends: 23 [2019-11-15 21:47:57,412 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:47:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-15 21:47:57,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-15 21:47:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 21:47:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-15 21:47:57,415 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 11 [2019-11-15 21:47:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:57,415 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-15 21:47:57,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:47:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-15 21:47:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 21:47:57,416 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:57,416 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:47:57,416 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:47:57,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:57,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1069165097, now seen corresponding path program 1 times [2019-11-15 21:47:57,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:57,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446951349] [2019-11-15 21:47:57,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:57,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:57,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:47:57,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446951349] [2019-11-15 21:47:57,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:57,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:47:57,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476558905] [2019-11-15 21:47:57,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:47:57,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:57,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:47:57,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:47:57,469 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 5 states. [2019-11-15 21:47:57,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:57,518 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-15 21:47:57,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:47:57,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-15 21:47:57,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:57,519 INFO L225 Difference]: With dead ends: 28 [2019-11-15 21:47:57,519 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:47:57,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:47:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:47:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:47:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:47:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:47:57,520 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-11-15 21:47:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:57,520 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:47:57,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:47:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:47:57,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:47:57,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:47:57,597 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:47:57,598 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-15 21:47:57,598 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-15 21:47:57,598 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-15 21:47:57,598 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2019-11-15 21:47:57,598 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-11-15 21:47:57,599 INFO L443 ceAbstractionStarter]: For program point L17(lines 17 25) no Hoare annotation was computed. [2019-11-15 21:47:57,599 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-11-15 21:47:57,599 INFO L439 ceAbstractionStarter]: At program point L19-2(lines 18 24) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= ULTIMATE.start_main_~y~0 2147483647) (<= 0 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0)) [2019-11-15 21:47:57,599 INFO L443 ceAbstractionStarter]: For program point L17-1(lines 17 25) no Hoare annotation was computed. [2019-11-15 21:47:57,599 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:47:57,599 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:47:57,600 INFO L439 ceAbstractionStarter]: At program point L26(lines 13 27) the Hoare annotation is: (or (<= ULTIMATE.start_main_~x~0 2147483647) (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~y~0 2147483647))) [2019-11-15 21:47:57,600 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-15 21:47:57,600 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-15 21:47:57,600 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-15 21:47:57,600 INFO L443 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-11-15 21:47:57,600 INFO L443 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-15 21:47:57,601 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-15 21:47:57,601 INFO L443 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-15 21:47:57,601 INFO L443 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2019-11-15 21:47:57,601 INFO L443 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. [2019-11-15 21:47:57,601 INFO L443 ceAbstractionStarter]: For program point L18-4(line 18) no Hoare annotation was computed. [2019-11-15 21:47:57,601 INFO L443 ceAbstractionStarter]: For program point L18-5(line 18) no Hoare annotation was computed. [2019-11-15 21:47:57,601 INFO L443 ceAbstractionStarter]: For program point L18-6(lines 18 24) no Hoare annotation was computed. [2019-11-15 21:47:57,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:47:57 BoogieIcfgContainer [2019-11-15 21:47:57,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:47:57,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:47:57,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:47:57,616 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:47:57,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:47:55" (3/4) ... [2019-11-15 21:47:57,620 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:47:57,630 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 21:47:57,630 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:47:57,674 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_38d9991d-3e0f-4d1c-a813-11319d066246/bin/uautomizer/witness.graphml [2019-11-15 21:47:57,674 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:47:57,676 INFO L168 Benchmark]: Toolchain (without parser) took 2398.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 944.7 MB in the beginning and 976.1 MB in the end (delta: -31.4 MB). Peak memory consumption was 126.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:47:57,676 INFO L168 Benchmark]: CDTParser took 1.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:47:57,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -206.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:47:57,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:47:57,678 INFO L168 Benchmark]: Boogie Preprocessor took 28.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:47:57,678 INFO L168 Benchmark]: RCFGBuilder took 267.50 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:47:57,679 INFO L168 Benchmark]: TraceAbstraction took 1666.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.1 MB in the end (delta: 150.0 MB). Peak memory consumption was 150.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:47:57,679 INFO L168 Benchmark]: Witness Printer took 58.54 ms. Allocated memory is still 1.2 GB. Free memory is still 976.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:47:57,681 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -206.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 267.50 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1666.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.1 MB in the end (delta: 150.0 MB). Peak memory consumption was 150.0 MB. Max. memory is 11.5 GB. * Witness Printer took 58.54 ms. Allocated memory is still 1.2 GB. Free memory is still 976.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: 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: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: 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: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: x <= 2147483647 || x <= y + 2147483647 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((x <= 2147483647 && y <= 2147483647) && 0 <= x) && 0 <= y - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 8 error locations. Result: SAFE, OverallTime: 1.5s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 87 SDtfs, 260 SDslu, 39 SDs, 0 SdLazy, 342 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 8 NumberOfFragments, 22 HoareAnnotationTreeSize, 2 FomulaSimplifications, 39 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 51 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 2067 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 3/3 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...