/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Addition03-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 15:54:51,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 15:54:51,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 15:54:51,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 15:54:51,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 15:54:51,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 15:54:51,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 15:54:51,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 15:54:51,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 15:54:51,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 15:54:51,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 15:54:51,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 15:54:51,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 15:54:51,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 15:54:51,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 15:54:51,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 15:54:51,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 15:54:51,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 15:54:51,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 15:54:51,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 15:54:51,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 15:54:51,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 15:54:51,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 15:54:51,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 15:54:51,245 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 15:54:51,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 15:54:51,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 15:54:51,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 15:54:51,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 15:54:51,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 15:54:51,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 15:54:51,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 15:54:51,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 15:54:51,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 15:54:51,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 15:54:51,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 15:54:51,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 15:54:51,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 15:54:51,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 15:54:51,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 15:54:51,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 15:54:51,257 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 15:54:51,284 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 15:54:51,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 15:54:51,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 15:54:51,290 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 15:54:51,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 15:54:51,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 15:54:51,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 15:54:51,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 15:54:51,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 15:54:51,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 15:54:51,295 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 15:54:51,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 15:54:51,295 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 15:54:51,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 15:54:51,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 15:54:51,296 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 15:54:51,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 15:54:51,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 15:54:51,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 15:54:51,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 15:54:51,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 15:54:51,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 15:54:51,297 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 15:54:51,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 15:54:51,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 15:54:51,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 15:54:51,586 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 15:54:51,587 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 15:54:51,588 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Addition03-1.c [2020-07-08 15:54:51,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf7264f80/080da2c00ef34be68452d99c597c434f/FLAG0ecd59d00 [2020-07-08 15:54:52,108 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 15:54:52,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Addition03-1.c [2020-07-08 15:54:52,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf7264f80/080da2c00ef34be68452d99c597c434f/FLAG0ecd59d00 [2020-07-08 15:54:52,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf7264f80/080da2c00ef34be68452d99c597c434f [2020-07-08 15:54:52,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 15:54:52,514 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 15:54:52,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 15:54:52,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 15:54:52,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 15:54:52,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@782b79c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52, skipping insertion in model container [2020-07-08 15:54:52,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 15:54:52,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 15:54:52,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:54:52,762 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 15:54:52,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:54:52,803 INFO L208 MainTranslator]: Completed translation [2020-07-08 15:54:52,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52 WrapperNode [2020-07-08 15:54:52,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 15:54:52,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 15:54:52,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 15:54:52,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 15:54:52,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 15:54:52,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 15:54:52,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 15:54:52,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 15:54:52,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-08 15:54:52,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 15:54:52,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 15:54:52,988 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2020-07-08 15:54:52,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 15:54:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 15:54:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 15:54:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2020-07-08 15:54:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 15:54:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 15:54:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 15:54:53,331 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 15:54:53,331 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 15:54:53,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:54:53 BoogieIcfgContainer [2020-07-08 15:54:53,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 15:54:53,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 15:54:53,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 15:54:53,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 15:54:53,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 03:54:52" (1/3) ... [2020-07-08 15:54:53,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611ccf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:54:53, skipping insertion in model container [2020-07-08 15:54:53,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (2/3) ... [2020-07-08 15:54:53,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611ccf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:54:53, skipping insertion in model container [2020-07-08 15:54:53,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:54:53" (3/3) ... [2020-07-08 15:54:53,344 INFO L109 eAbstractionObserver]: Analyzing ICFG Addition03-1.c [2020-07-08 15:54:53,354 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 15:54:53,360 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 15:54:53,373 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 15:54:53,394 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 15:54:53,394 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 15:54:53,394 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 15:54:53,394 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 15:54:53,395 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 15:54:53,395 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 15:54:53,395 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 15:54:53,395 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 15:54:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-08 15:54:53,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 15:54:53,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:53,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:54:53,424 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:53,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:53,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1218957033, now seen corresponding path program 1 times [2020-07-08 15:54:53,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:53,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [663777482] [2020-07-08 15:54:53,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:54:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:53,654 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-08 15:54:53,655 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {41#true} {41#true} #48#return; {41#true} is VALID [2020-07-08 15:54:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:53,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} ~m := #in~m; {41#true} is VALID [2020-07-08 15:54:53,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} ~n := #in~n; {52#(= |addition_#in~n| addition_~n)} is VALID [2020-07-08 15:54:53,738 INFO L280 TraceCheckUtils]: 2: Hoare triple {52#(= |addition_#in~n| addition_~n)} assume 0 == ~n; {53#(= 0 |addition_#in~n|)} is VALID [2020-07-08 15:54:53,740 INFO L280 TraceCheckUtils]: 3: Hoare triple {53#(= 0 |addition_#in~n|)} #res := ~m; {53#(= 0 |addition_#in~n|)} is VALID [2020-07-08 15:54:53,741 INFO L280 TraceCheckUtils]: 4: Hoare triple {53#(= 0 |addition_#in~n|)} assume true; {53#(= 0 |addition_#in~n|)} is VALID [2020-07-08 15:54:53,743 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {53#(= 0 |addition_#in~n|)} {41#true} #52#return; {51#(<= main_~n~0 0)} is VALID [2020-07-08 15:54:53,744 INFO L263 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2020-07-08 15:54:53,744 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-08 15:54:53,745 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #48#return; {41#true} is VALID [2020-07-08 15:54:53,745 INFO L263 TraceCheckUtils]: 3: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2020-07-08 15:54:53,746 INFO L280 TraceCheckUtils]: 4: Hoare triple {41#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {41#true} is VALID [2020-07-08 15:54:53,746 INFO L280 TraceCheckUtils]: 5: Hoare triple {41#true} ~m~0 := #t~nondet2; {41#true} is VALID [2020-07-08 15:54:53,747 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#true} havoc #t~nondet2; {41#true} is VALID [2020-07-08 15:54:53,747 INFO L280 TraceCheckUtils]: 7: Hoare triple {41#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {41#true} is VALID [2020-07-08 15:54:53,748 INFO L280 TraceCheckUtils]: 8: Hoare triple {41#true} ~n~0 := #t~nondet3; {41#true} is VALID [2020-07-08 15:54:53,748 INFO L280 TraceCheckUtils]: 9: Hoare triple {41#true} havoc #t~nondet3; {41#true} is VALID [2020-07-08 15:54:53,749 INFO L263 TraceCheckUtils]: 10: Hoare triple {41#true} call #t~ret4 := addition(~m~0, ~n~0); {41#true} is VALID [2020-07-08 15:54:53,749 INFO L280 TraceCheckUtils]: 11: Hoare triple {41#true} ~m := #in~m; {41#true} is VALID [2020-07-08 15:54:53,750 INFO L280 TraceCheckUtils]: 12: Hoare triple {41#true} ~n := #in~n; {52#(= |addition_#in~n| addition_~n)} is VALID [2020-07-08 15:54:53,751 INFO L280 TraceCheckUtils]: 13: Hoare triple {52#(= |addition_#in~n| addition_~n)} assume 0 == ~n; {53#(= 0 |addition_#in~n|)} is VALID [2020-07-08 15:54:53,752 INFO L280 TraceCheckUtils]: 14: Hoare triple {53#(= 0 |addition_#in~n|)} #res := ~m; {53#(= 0 |addition_#in~n|)} is VALID [2020-07-08 15:54:53,753 INFO L280 TraceCheckUtils]: 15: Hoare triple {53#(= 0 |addition_#in~n|)} assume true; {53#(= 0 |addition_#in~n|)} is VALID [2020-07-08 15:54:53,756 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {53#(= 0 |addition_#in~n|)} {41#true} #52#return; {51#(<= main_~n~0 0)} is VALID [2020-07-08 15:54:53,757 INFO L280 TraceCheckUtils]: 17: Hoare triple {51#(<= main_~n~0 0)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807; {51#(<= main_~n~0 0)} is VALID [2020-07-08 15:54:53,758 INFO L280 TraceCheckUtils]: 18: Hoare triple {51#(<= main_~n~0 0)} ~result~0 := #t~ret4; {51#(<= main_~n~0 0)} is VALID [2020-07-08 15:54:53,759 INFO L280 TraceCheckUtils]: 19: Hoare triple {51#(<= main_~n~0 0)} havoc #t~ret4; {51#(<= main_~n~0 0)} is VALID [2020-07-08 15:54:53,760 INFO L280 TraceCheckUtils]: 20: Hoare triple {51#(<= main_~n~0 0)} assume !((~m~0 < 100 || ~n~0 < 100) || ~result~0 >= 200); {42#false} is VALID [2020-07-08 15:54:53,761 INFO L280 TraceCheckUtils]: 21: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-08 15:54:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 15:54:53,764 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:54:53,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [663777482] [2020-07-08 15:54:53,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:54:53,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 15:54:53,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841620631] [2020-07-08 15:54:53,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-08 15:54:53,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:54:53,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 15:54:53,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:53,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 15:54:53,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:54:53,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 15:54:53,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 15:54:53,845 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2020-07-08 15:54:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:54,264 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2020-07-08 15:54:54,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 15:54:54,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-08 15:54:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:54:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 15:54:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-08 15:54:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 15:54:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-08 15:54:54,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2020-07-08 15:54:54,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:54,385 INFO L225 Difference]: With dead ends: 53 [2020-07-08 15:54:54,386 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 15:54:54,389 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 15:54:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 15:54:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-08 15:54:54,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:54:54,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-08 15:54:54,464 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-08 15:54:54,464 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-08 15:54:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:54,472 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-08 15:54:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-08 15:54:54,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:54,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:54,474 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-08 15:54:54,474 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-08 15:54:54,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:54,480 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-08 15:54:54,480 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-08 15:54:54,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:54,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:54,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:54:54,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:54:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-08 15:54:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2020-07-08 15:54:54,488 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 22 [2020-07-08 15:54:54,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:54:54,489 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2020-07-08 15:54:54,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 15:54:54,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 40 transitions. [2020-07-08 15:54:54,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:54,539 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-08 15:54:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 15:54:54,541 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:54,541 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:54:54,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 15:54:54,542 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:54,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:54,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1947313727, now seen corresponding path program 1 times [2020-07-08 15:54:54,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:54,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1834577291] [2020-07-08 15:54:54,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:54:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:54,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {304#true} assume true; {304#true} is VALID [2020-07-08 15:54:54,576 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {304#true} {304#true} #48#return; {304#true} is VALID [2020-07-08 15:54:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:54,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {304#true} ~m := #in~m; {304#true} is VALID [2020-07-08 15:54:54,610 INFO L280 TraceCheckUtils]: 1: Hoare triple {304#true} ~n := #in~n; {304#true} is VALID [2020-07-08 15:54:54,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {304#true} assume !(0 == ~n); {315#(not (= 0 addition_~n))} is VALID [2020-07-08 15:54:54,613 INFO L280 TraceCheckUtils]: 3: Hoare triple {315#(not (= 0 addition_~n))} assume !(~n > 0); {316#(and (<= addition_~n 0) (not (= 0 addition_~n)))} is VALID [2020-07-08 15:54:54,614 INFO L280 TraceCheckUtils]: 4: Hoare triple {316#(and (<= addition_~n 0) (not (= 0 addition_~n)))} assume !(~n < 0); {305#false} is VALID [2020-07-08 15:54:54,614 INFO L280 TraceCheckUtils]: 5: Hoare triple {305#false} assume true; {305#false} is VALID [2020-07-08 15:54:54,615 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {305#false} {304#true} #52#return; {305#false} is VALID [2020-07-08 15:54:54,615 INFO L263 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {304#true} is VALID [2020-07-08 15:54:54,616 INFO L280 TraceCheckUtils]: 1: Hoare triple {304#true} assume true; {304#true} is VALID [2020-07-08 15:54:54,616 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {304#true} {304#true} #48#return; {304#true} is VALID [2020-07-08 15:54:54,616 INFO L263 TraceCheckUtils]: 3: Hoare triple {304#true} call #t~ret5 := main(); {304#true} is VALID [2020-07-08 15:54:54,616 INFO L280 TraceCheckUtils]: 4: Hoare triple {304#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {304#true} is VALID [2020-07-08 15:54:54,617 INFO L280 TraceCheckUtils]: 5: Hoare triple {304#true} ~m~0 := #t~nondet2; {304#true} is VALID [2020-07-08 15:54:54,617 INFO L280 TraceCheckUtils]: 6: Hoare triple {304#true} havoc #t~nondet2; {304#true} is VALID [2020-07-08 15:54:54,617 INFO L280 TraceCheckUtils]: 7: Hoare triple {304#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {304#true} is VALID [2020-07-08 15:54:54,618 INFO L280 TraceCheckUtils]: 8: Hoare triple {304#true} ~n~0 := #t~nondet3; {304#true} is VALID [2020-07-08 15:54:54,618 INFO L280 TraceCheckUtils]: 9: Hoare triple {304#true} havoc #t~nondet3; {304#true} is VALID [2020-07-08 15:54:54,618 INFO L263 TraceCheckUtils]: 10: Hoare triple {304#true} call #t~ret4 := addition(~m~0, ~n~0); {304#true} is VALID [2020-07-08 15:54:54,619 INFO L280 TraceCheckUtils]: 11: Hoare triple {304#true} ~m := #in~m; {304#true} is VALID [2020-07-08 15:54:54,619 INFO L280 TraceCheckUtils]: 12: Hoare triple {304#true} ~n := #in~n; {304#true} is VALID [2020-07-08 15:54:54,620 INFO L280 TraceCheckUtils]: 13: Hoare triple {304#true} assume !(0 == ~n); {315#(not (= 0 addition_~n))} is VALID [2020-07-08 15:54:54,621 INFO L280 TraceCheckUtils]: 14: Hoare triple {315#(not (= 0 addition_~n))} assume !(~n > 0); {316#(and (<= addition_~n 0) (not (= 0 addition_~n)))} is VALID [2020-07-08 15:54:54,622 INFO L280 TraceCheckUtils]: 15: Hoare triple {316#(and (<= addition_~n 0) (not (= 0 addition_~n)))} assume !(~n < 0); {305#false} is VALID [2020-07-08 15:54:54,622 INFO L280 TraceCheckUtils]: 16: Hoare triple {305#false} assume true; {305#false} is VALID [2020-07-08 15:54:54,622 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {305#false} {304#true} #52#return; {305#false} is VALID [2020-07-08 15:54:54,623 INFO L280 TraceCheckUtils]: 18: Hoare triple {305#false} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807; {305#false} is VALID [2020-07-08 15:54:54,623 INFO L280 TraceCheckUtils]: 19: Hoare triple {305#false} ~result~0 := #t~ret4; {305#false} is VALID [2020-07-08 15:54:54,623 INFO L280 TraceCheckUtils]: 20: Hoare triple {305#false} havoc #t~ret4; {305#false} is VALID [2020-07-08 15:54:54,624 INFO L280 TraceCheckUtils]: 21: Hoare triple {305#false} assume !((~m~0 < 100 || ~n~0 < 100) || ~result~0 >= 200); {305#false} is VALID [2020-07-08 15:54:54,624 INFO L280 TraceCheckUtils]: 22: Hoare triple {305#false} assume !false; {305#false} is VALID [2020-07-08 15:54:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 15:54:54,625 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:54:54,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1834577291] [2020-07-08 15:54:54,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:54:54,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 15:54:54,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682701083] [2020-07-08 15:54:54,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-08 15:54:54,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:54:54,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 15:54:54,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:54,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 15:54:54,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:54:54,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 15:54:54,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-08 15:54:54,653 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 4 states. [2020-07-08 15:54:54,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:54,799 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2020-07-08 15:54:54,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 15:54:54,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-08 15:54:54,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:54:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 15:54:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2020-07-08 15:54:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 15:54:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2020-07-08 15:54:54,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2020-07-08 15:54:54,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:54,893 INFO L225 Difference]: With dead ends: 51 [2020-07-08 15:54:54,893 INFO L226 Difference]: Without dead ends: 37 [2020-07-08 15:54:54,895 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-08 15:54:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-08 15:54:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-07-08 15:54:54,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:54:54,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2020-07-08 15:54:54,943 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2020-07-08 15:54:54,943 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2020-07-08 15:54:54,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:54,949 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-08 15:54:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-08 15:54:54,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:54,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:54,950 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2020-07-08 15:54:54,951 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2020-07-08 15:54:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:54,955 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-08 15:54:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-08 15:54:54,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:54,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:54,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:54:54,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:54:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-08 15:54:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-08 15:54:54,961 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 23 [2020-07-08 15:54:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:54:54,962 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-08 15:54:54,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 15:54:54,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2020-07-08 15:54:55,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-08 15:54:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-08 15:54:55,022 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:55,023 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:54:55,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 15:54:55,024 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:55,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:55,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1438677315, now seen corresponding path program 1 times [2020-07-08 15:54:55,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:55,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [18775374] [2020-07-08 15:54:55,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:54:55,049 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 15:54:55,050 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-08 15:54:55,056 INFO L168 Benchmark]: Toolchain (without parser) took 2542.39 ms. Allocated memory was 146.8 MB in the beginning and 234.9 MB in the end (delta: 88.1 MB). Free memory was 104.0 MB in the beginning and 99.5 MB in the end (delta: 4.5 MB). Peak memory consumption was 92.5 MB. Max. memory is 7.1 GB. [2020-07-08 15:54:55,058 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 15:54:55,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.31 ms. Allocated memory is still 146.8 MB. Free memory was 103.5 MB in the beginning and 94.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-08 15:54:55,059 INFO L168 Benchmark]: Boogie Preprocessor took 36.52 ms. Allocated memory is still 146.8 MB. Free memory was 94.0 MB in the beginning and 92.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-08 15:54:55,060 INFO L168 Benchmark]: RCFGBuilder took 494.10 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 92.6 MB in the beginning and 163.4 MB in the end (delta: -70.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 15:54:55,061 INFO L168 Benchmark]: TraceAbstraction took 1716.66 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 162.7 MB in the beginning and 99.5 MB in the end (delta: 63.2 MB). Peak memory consumption was 94.2 MB. Max. memory is 7.1 GB. [2020-07-08 15:54:55,066 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 146.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.31 ms. Allocated memory is still 146.8 MB. Free memory was 103.5 MB in the beginning and 94.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.52 ms. Allocated memory is still 146.8 MB. Free memory was 94.0 MB in the beginning and 92.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 494.10 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 92.6 MB in the beginning and 163.4 MB in the end (delta: -70.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1716.66 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 162.7 MB in the beginning and 99.5 MB in the end (delta: 63.2 MB). Peak memory consumption was 94.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...