./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7d8ed2e7-2233-41c2-a2cc-56580b556a31/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7d8ed2e7-2233-41c2-a2cc-56580b556a31/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7d8ed2e7-2233-41c2-a2cc-56580b556a31/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7d8ed2e7-2233-41c2-a2cc-56580b556a31/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7d8ed2e7-2233-41c2-a2cc-56580b556a31/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7d8ed2e7-2233-41c2-a2cc-56580b556a31/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-6b5699a [2019-11-25 08:50:27,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:50:27,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:50:27,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:50:27,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:50:27,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:50:27,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:50:27,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:50:27,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:50:27,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:50:27,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:50:27,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:50:27,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:50:27,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:50:27,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:50:27,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:50:27,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:50:28,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:50:28,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:50:28,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:50:28,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:50:28,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:50:28,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:50:28,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:50:28,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:50:28,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:50:28,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:50:28,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:50:28,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:50:28,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:50:28,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:50:28,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:50:28,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:50:28,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:50:28,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:50:28,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:50:28,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:50:28,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:50:28,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:50:28,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:50:28,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:50:28,020 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7d8ed2e7-2233-41c2-a2cc-56580b556a31/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-25 08:50:28,032 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:50:28,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:50:28,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:50:28,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:50:28,034 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:50:28,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:50:28,034 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:50:28,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:50:28,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:50:28,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:50:28,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:50:28,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:50:28,036 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-25 08:50:28,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:50:28,036 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:50:28,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:50:28,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:50:28,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:50:28,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:50:28,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:50:28,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:50:28,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:50:28,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:50:28,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:50:28,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:50:28,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:50:28,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:50:28,039 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_7d8ed2e7-2233-41c2-a2cc-56580b556a31/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-25 08:50:28,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:50:28,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:50:28,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:50:28,179 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:50:28,179 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:50:28,180 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7d8ed2e7-2233-41c2-a2cc-56580b556a31/bin/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c [2019-11-25 08:50:28,235 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d8ed2e7-2233-41c2-a2cc-56580b556a31/bin/uautomizer/data/42c4cfb64/ac3214e8210e4837b7eceff8977520e5/FLAG18009cfb7 [2019-11-25 08:50:28,605 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:50:28,605 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7d8ed2e7-2233-41c2-a2cc-56580b556a31/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c [2019-11-25 08:50:28,611 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d8ed2e7-2233-41c2-a2cc-56580b556a31/bin/uautomizer/data/42c4cfb64/ac3214e8210e4837b7eceff8977520e5/FLAG18009cfb7 [2019-11-25 08:50:28,626 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7d8ed2e7-2233-41c2-a2cc-56580b556a31/bin/uautomizer/data/42c4cfb64/ac3214e8210e4837b7eceff8977520e5 [2019-11-25 08:50:28,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:50:28,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:50:28,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:28,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:50:28,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:50:28,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:28" (1/1) ... [2019-11-25 08:50:28,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c744da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:28, skipping insertion in model container [2019-11-25 08:50:28,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:28" (1/1) ... [2019-11-25 08:50:28,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:50:28,667 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:50:28,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:28,822 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:50:28,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:28,960 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:50:28,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:28 WrapperNode [2019-11-25 08:50:28,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:28,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:28,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:50:28,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:50:28,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:28" (1/1) ... [2019-11-25 08:50:28,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:28" (1/1) ... [2019-11-25 08:50:28,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:28,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:50:28,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:50:28,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:50:29,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:28" (1/1) ... [2019-11-25 08:50:29,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:28" (1/1) ... [2019-11-25 08:50:29,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:28" (1/1) ... [2019-11-25 08:50:29,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:28" (1/1) ... [2019-11-25 08:50:29,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:28" (1/1) ... [2019-11-25 08:50:29,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:28" (1/1) ... [2019-11-25 08:50:29,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:28" (1/1) ... [2019-11-25 08:50:29,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:50:29,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:50:29,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:50:29,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:50:29,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d8ed2e7-2233-41c2-a2cc-56580b556a31/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:50:29,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:50:29,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:50:29,273 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:50:29,273 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-25 08:50:29,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:29 BoogieIcfgContainer [2019-11-25 08:50:29,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:50:29,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:50:29,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:50:29,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:50:29,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:50:28" (1/3) ... [2019-11-25 08:50:29,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17eea4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:50:29, skipping insertion in model container [2019-11-25 08:50:29,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:28" (2/3) ... [2019-11-25 08:50:29,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17eea4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:50:29, skipping insertion in model container [2019-11-25 08:50:29,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:29" (3/3) ... [2019-11-25 08:50:29,293 INFO L109 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-wise.c [2019-11-25 08:50:29,301 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:50:29,307 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-25 08:50:29,317 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-25 08:50:29,340 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:50:29,341 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:50:29,341 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:50:29,341 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:50:29,341 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:50:29,342 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:50:29,342 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:50:29,342 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:50:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-25 08:50:29,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-25 08:50:29,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:29,374 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-25 08:50:29,375 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:50:29,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:29,380 INFO L82 PathProgramCache]: Analyzing trace with hash 30885, now seen corresponding path program 1 times [2019-11-25 08:50:29,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:29,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013702579] [2019-11-25 08:50:29,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:29,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013702579] [2019-11-25 08:50:29,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:29,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:50:29,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593722486] [2019-11-25 08:50:29,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:29,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:29,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:29,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:29,536 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2019-11-25 08:50:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:29,677 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2019-11-25 08:50:29,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:50:29,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-11-25 08:50:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:29,689 INFO L225 Difference]: With dead ends: 53 [2019-11-25 08:50:29,690 INFO L226 Difference]: Without dead ends: 35 [2019-11-25 08:50:29,695 INFO L630 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-25 08:50:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-25 08:50:29,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2019-11-25 08:50:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-25 08:50:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-11-25 08:50:29,734 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 3 [2019-11-25 08:50:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:29,734 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-25 08:50:29,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-11-25 08:50:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-25 08:50:29,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:29,735 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-25 08:50:29,736 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:50:29,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:29,736 INFO L82 PathProgramCache]: Analyzing trace with hash 957477, now seen corresponding path program 1 times [2019-11-25 08:50:29,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:29,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84798150] [2019-11-25 08:50:29,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:29,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84798150] [2019-11-25 08:50:29,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:29,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:50:29,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405010965] [2019-11-25 08:50:29,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:29,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:29,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:29,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:29,770 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 4 states. [2019-11-25 08:50:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:29,903 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-11-25 08:50:29,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:50:29,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-11-25 08:50:29,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:29,905 INFO L225 Difference]: With dead ends: 47 [2019-11-25 08:50:29,906 INFO L226 Difference]: Without dead ends: 45 [2019-11-25 08:50:29,906 INFO L630 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-25 08:50:29,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-25 08:50:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2019-11-25 08:50:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-25 08:50:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-25 08:50:29,914 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 4 [2019-11-25 08:50:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:29,914 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-25 08:50:29,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-25 08:50:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-25 08:50:29,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:29,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:29,916 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:50:29,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:29,916 INFO L82 PathProgramCache]: Analyzing trace with hash -511748973, now seen corresponding path program 1 times [2019-11-25 08:50:29,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:29,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540254416] [2019-11-25 08:50:29,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:29,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540254416] [2019-11-25 08:50:29,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:29,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:29,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343098872] [2019-11-25 08:50:29,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:29,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:29,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:29,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:29,963 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2019-11-25 08:50:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:30,082 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2019-11-25 08:50:30,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:50:30,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-11-25 08:50:30,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:30,084 INFO L225 Difference]: With dead ends: 79 [2019-11-25 08:50:30,084 INFO L226 Difference]: Without dead ends: 78 [2019-11-25 08:50:30,085 INFO L630 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-25 08:50:30,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-25 08:50:30,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2019-11-25 08:50:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-25 08:50:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2019-11-25 08:50:30,095 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 8 [2019-11-25 08:50:30,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:30,095 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2019-11-25 08:50:30,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2019-11-25 08:50:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-25 08:50:30,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:30,097 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:30,097 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:50:30,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:30,097 INFO L82 PathProgramCache]: Analyzing trace with hash -511749165, now seen corresponding path program 1 times [2019-11-25 08:50:30,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:30,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030964421] [2019-11-25 08:50:30,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:30,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030964421] [2019-11-25 08:50:30,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:30,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:30,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708782349] [2019-11-25 08:50:30,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:30,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:30,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:30,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:30,137 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand 4 states. [2019-11-25 08:50:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:30,190 INFO L93 Difference]: Finished difference Result 96 states and 130 transitions. [2019-11-25 08:50:30,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:30,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-25 08:50:30,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:30,193 INFO L225 Difference]: With dead ends: 96 [2019-11-25 08:50:30,193 INFO L226 Difference]: Without dead ends: 51 [2019-11-25 08:50:30,193 INFO L630 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-25 08:50:30,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-25 08:50:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2019-11-25 08:50:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-25 08:50:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-11-25 08:50:30,203 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 8 [2019-11-25 08:50:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:30,203 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-25 08:50:30,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-11-25 08:50:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 08:50:30,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:30,204 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:30,205 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:50:30,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:30,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1315651091, now seen corresponding path program 1 times [2019-11-25 08:50:30,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:30,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375090906] [2019-11-25 08:50:30,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:30,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375090906] [2019-11-25 08:50:30,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:30,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:50:30,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241819046] [2019-11-25 08:50:30,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:30,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:30,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:30,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:30,257 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 3 states. [2019-11-25 08:50:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:30,286 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-11-25 08:50:30,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:30,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-25 08:50:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:30,289 INFO L225 Difference]: With dead ends: 42 [2019-11-25 08:50:30,289 INFO L226 Difference]: Without dead ends: 41 [2019-11-25 08:50:30,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:30,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-25 08:50:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-25 08:50:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-25 08:50:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2019-11-25 08:50:30,295 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 9 [2019-11-25 08:50:30,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:30,295 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-11-25 08:50:30,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:30,296 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2019-11-25 08:50:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:50:30,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:30,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:30,301 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:50:30,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:30,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2115076497, now seen corresponding path program 1 times [2019-11-25 08:50:30,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:30,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881342868] [2019-11-25 08:50:30,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:30,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881342868] [2019-11-25 08:50:30,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:30,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:30,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515474049] [2019-11-25 08:50:30,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:30,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:30,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:30,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:30,349 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2019-11-25 08:50:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:30,387 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-11-25 08:50:30,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:30,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-25 08:50:30,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:30,388 INFO L225 Difference]: With dead ends: 75 [2019-11-25 08:50:30,388 INFO L226 Difference]: Without dead ends: 40 [2019-11-25 08:50:30,389 INFO L630 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-25 08:50:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-25 08:50:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2019-11-25 08:50:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-25 08:50:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-11-25 08:50:30,394 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 10 [2019-11-25 08:50:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:30,395 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-11-25 08:50:30,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:30,395 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-11-25 08:50:30,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:50:30,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:30,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:30,396 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:50:30,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:30,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2115076689, now seen corresponding path program 1 times [2019-11-25 08:50:30,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:30,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444247255] [2019-11-25 08:50:30,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:30,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444247255] [2019-11-25 08:50:30,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:30,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:30,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933244379] [2019-11-25 08:50:30,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:30,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:30,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:30,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:30,430 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 5 states. [2019-11-25 08:50:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:30,510 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-25 08:50:30,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:50:30,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-25 08:50:30,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:30,511 INFO L225 Difference]: With dead ends: 54 [2019-11-25 08:50:30,512 INFO L226 Difference]: Without dead ends: 53 [2019-11-25 08:50:30,512 INFO L630 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-25 08:50:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-25 08:50:30,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-11-25 08:50:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-25 08:50:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-11-25 08:50:30,518 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 10 [2019-11-25 08:50:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:30,518 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-11-25 08:50:30,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-11-25 08:50:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 08:50:30,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:30,519 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:30,520 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:50:30,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:30,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1142867855, now seen corresponding path program 1 times [2019-11-25 08:50:30,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:30,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999069016] [2019-11-25 08:50:30,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:30,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999069016] [2019-11-25 08:50:30,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:30,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:50:30,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130694174] [2019-11-25 08:50:30,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:30,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:30,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:30,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:30,542 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2019-11-25 08:50:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:30,561 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-11-25 08:50:30,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:30,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-25 08:50:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:30,563 INFO L225 Difference]: With dead ends: 44 [2019-11-25 08:50:30,563 INFO L226 Difference]: Without dead ends: 43 [2019-11-25 08:50:30,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-25 08:50:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-25 08:50:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-25 08:50:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-11-25 08:50:30,568 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 11 [2019-11-25 08:50:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:30,569 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-11-25 08:50:30,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-11-25 08:50:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 08:50:30,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:30,570 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:30,570 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:50:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:30,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1620314709, now seen corresponding path program 1 times [2019-11-25 08:50:30,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:30,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650433485] [2019-11-25 08:50:30,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:30,628 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-25 08:50:30,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650433485] [2019-11-25 08:50:30,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:30,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:30,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697410293] [2019-11-25 08:50:30,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:30,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:30,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:30,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:30,630 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 5 states. [2019-11-25 08:50:30,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:30,714 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-11-25 08:50:30,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:50:30,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-25 08:50:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:30,715 INFO L225 Difference]: With dead ends: 56 [2019-11-25 08:50:30,715 INFO L226 Difference]: Without dead ends: 23 [2019-11-25 08:50:30,715 INFO L630 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-25 08:50:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-25 08:50:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-25 08:50:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-25 08:50:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-25 08:50:30,719 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 11 [2019-11-25 08:50:30,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:30,719 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-25 08:50:30,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:30,719 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-25 08:50:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 08:50:30,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:30,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:30,720 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:50:30,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:30,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1069165097, now seen corresponding path program 1 times [2019-11-25 08:50:30,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:30,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443363358] [2019-11-25 08:50:30,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:30,762 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-25 08:50:30,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443363358] [2019-11-25 08:50:30,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:30,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:30,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231098050] [2019-11-25 08:50:30,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:30,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:30,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:30,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:30,764 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 5 states. [2019-11-25 08:50:30,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:30,816 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-25 08:50:30,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:50:30,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-25 08:50:30,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:30,817 INFO L225 Difference]: With dead ends: 28 [2019-11-25 08:50:30,817 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:50:30,818 INFO L630 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-25 08:50:30,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:50:30,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:50:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:50:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:50:30,818 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-11-25 08:50:30,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:30,818 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:50:30,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:30,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:50:30,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:50:30,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:50:30,889 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-25 08:50:30,889 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:50:30,889 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-25 08:50:30,890 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-25 08:50:30,890 INFO L444 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2019-11-25 08:50:30,890 INFO L444 ceAbstractionStarter]: For program point L17(lines 17 25) no Hoare annotation was computed. [2019-11-25 08:50:30,890 INFO L440 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-25 08:50:30,890 INFO L444 ceAbstractionStarter]: For program point L17-1(lines 17 25) no Hoare annotation was computed. [2019-11-25 08:50:30,890 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-11-25 08:50:30,890 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-25 08:50:30,891 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-11-25 08:50:30,891 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:50:30,891 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-25 08:50:30,891 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:50:30,891 INFO L440 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-25 08:50:30,891 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-25 08:50:30,892 INFO L444 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-11-25 08:50:30,892 INFO L444 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-25 08:50:30,892 INFO L444 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-25 08:50:30,892 INFO L444 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2019-11-25 08:50:30,892 INFO L444 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. [2019-11-25 08:50:30,892 INFO L444 ceAbstractionStarter]: For program point L18-4(line 18) no Hoare annotation was computed. [2019-11-25 08:50:30,893 INFO L444 ceAbstractionStarter]: For program point L18-5(line 18) no Hoare annotation was computed. [2019-11-25 08:50:30,893 INFO L444 ceAbstractionStarter]: For program point L18-6(lines 18 24) no Hoare annotation was computed. [2019-11-25 08:50:30,893 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-11-25 08:50:30,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:50:30 BoogieIcfgContainer [2019-11-25 08:50:30,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:50:30,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:50:30,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:50:30,910 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:50:30,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:29" (3/4) ... [2019-11-25 08:50:30,914 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:50:30,926 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 08:50:30,927 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:50:31,003 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7d8ed2e7-2233-41c2-a2cc-56580b556a31/bin/uautomizer/witness.graphml [2019-11-25 08:50:31,003 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:50:31,008 INFO L168 Benchmark]: Toolchain (without parser) took 2372.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 950.1 MB in the beginning and 959.7 MB in the end (delta: -9.6 MB). Peak memory consumption was 130.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:31,009 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:31,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:31,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:31,010 INFO L168 Benchmark]: Boogie Preprocessor took 16.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:31,010 INFO L168 Benchmark]: RCFGBuilder took 265.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:31,010 INFO L168 Benchmark]: TraceAbstraction took 1634.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 965.1 MB in the end (delta: 151.3 MB). Peak memory consumption was 151.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:31,011 INFO L168 Benchmark]: Witness Printer took 93.71 ms. Allocated memory is still 1.2 GB. Free memory was 965.1 MB in the beginning and 959.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:31,017 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.36 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.33 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 265.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1634.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 965.1 MB in the end (delta: 151.3 MB). Peak memory consumption was 151.3 MB. Max. memory is 11.5 GB. * Witness Printer took 93.71 ms. Allocated memory is still 1.2 GB. Free memory was 965.1 MB in the beginning and 959.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 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 - 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...