/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-8fc6572 [2020-07-10 18:36:06,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:36:06,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:36:06,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:36:06,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:36:06,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:36:06,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:36:06,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:36:06,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:36:06,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:36:06,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:36:06,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:36:06,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:36:06,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:36:06,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:36:06,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:36:06,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:36:06,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:36:06,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:36:06,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:36:06,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:36:06,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:36:06,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:36:06,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:36:06,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:36:06,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:36:06,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:36:06,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:36:06,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:36:06,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:36:06,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:36:06,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:36:06,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:36:06,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:36:06,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:36:06,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:36:06,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:36:06,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:36:06,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:36:06,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:36:06,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:36:06,518 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 18:36:06,527 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:36:06,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:36:06,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:36:06,529 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:36:06,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:36:06,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:36:06,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:36:06,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:36:06,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:36:06,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:36:06,530 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:36:06,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:36:06,531 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:36:06,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:36:06,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:36:06,532 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:36:06,532 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:36:06,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:36:06,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:36:06,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:36:06,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:36:06,533 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:36:06,533 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:36:06,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:36:06,878 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:36:06,882 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:36:06,883 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:36:06,884 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:36:06,885 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-10 18:36:06,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6e49bb13/e5de8a15182c4d0ba4483bdb6dbe1f0f/FLAGcd045d4fb [2020-07-10 18:36:07,447 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:36:07,448 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Addition03-1.c [2020-07-10 18:36:07,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6e49bb13/e5de8a15182c4d0ba4483bdb6dbe1f0f/FLAGcd045d4fb [2020-07-10 18:36:07,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6e49bb13/e5de8a15182c4d0ba4483bdb6dbe1f0f [2020-07-10 18:36:07,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:36:07,953 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:36:07,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:36:07,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:36:07,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:36:07,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:36:07" (1/1) ... [2020-07-10 18:36:07,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88066fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:07, skipping insertion in model container [2020-07-10 18:36:07,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:36:07" (1/1) ... [2020-07-10 18:36:07,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:36:07,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:36:08,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:36:08,215 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:36:08,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:36:08,254 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:36:08,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:08 WrapperNode [2020-07-10 18:36:08,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:36:08,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:36:08,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:36:08,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:36:08,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:08" (1/1) ... [2020-07-10 18:36:08,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:08" (1/1) ... [2020-07-10 18:36:08,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:08" (1/1) ... [2020-07-10 18:36:08,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:08" (1/1) ... [2020-07-10 18:36:08,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:08" (1/1) ... [2020-07-10 18:36:08,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:08" (1/1) ... [2020-07-10 18:36:08,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:08" (1/1) ... [2020-07-10 18:36:08,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:36:08,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:36:08,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:36:08,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:36:08,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:08" (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-10 18:36:08,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:36:08,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:36:08,449 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2020-07-10 18:36:08,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:36:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:36:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 18:36:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2020-07-10 18:36:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:36:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:36:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:36:08,796 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:36:08,796 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 18:36:08,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:36:08 BoogieIcfgContainer [2020-07-10 18:36:08,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:36:08,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:36:08,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:36:08,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:36:08,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:36:07" (1/3) ... [2020-07-10 18:36:08,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9ba78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:36:08, skipping insertion in model container [2020-07-10 18:36:08,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:08" (2/3) ... [2020-07-10 18:36:08,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9ba78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:36:08, skipping insertion in model container [2020-07-10 18:36:08,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:36:08" (3/3) ... [2020-07-10 18:36:08,821 INFO L109 eAbstractionObserver]: Analyzing ICFG Addition03-1.c [2020-07-10 18:36:08,846 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:36:08,854 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:36:08,865 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:36:08,885 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:36:08,886 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:36:08,886 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:36:08,886 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:36:08,886 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:36:08,886 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:36:08,886 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:36:08,887 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:36:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-10 18:36:08,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 18:36:08,910 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:08,911 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-10 18:36:08,911 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:08,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:08,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1218957033, now seen corresponding path program 1 times [2020-07-10 18:36:08,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:08,924 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [732369874] [2020-07-10 18:36:08,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:36:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:09,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-10 18:36:09,137 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {41#true} {41#true} #48#return; {41#true} is VALID [2020-07-10 18:36:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:09,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} ~m := #in~m; {41#true} is VALID [2020-07-10 18:36:09,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} ~n := #in~n; {52#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 18:36:09,200 INFO L280 TraceCheckUtils]: 2: Hoare triple {52#(= |addition_#in~n| addition_~n)} assume 0 == ~n; {53#(= 0 |addition_#in~n|)} is VALID [2020-07-10 18:36:09,201 INFO L280 TraceCheckUtils]: 3: Hoare triple {53#(= 0 |addition_#in~n|)} #res := ~m; {53#(= 0 |addition_#in~n|)} is VALID [2020-07-10 18:36:09,202 INFO L280 TraceCheckUtils]: 4: Hoare triple {53#(= 0 |addition_#in~n|)} assume true; {53#(= 0 |addition_#in~n|)} is VALID [2020-07-10 18:36:09,205 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {53#(= 0 |addition_#in~n|)} {41#true} #52#return; {51#(<= main_~n~0 0)} is VALID [2020-07-10 18:36:09,206 INFO L263 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2020-07-10 18:36:09,207 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-10 18:36:09,208 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #48#return; {41#true} is VALID [2020-07-10 18:36:09,208 INFO L263 TraceCheckUtils]: 3: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2020-07-10 18:36:09,209 INFO L280 TraceCheckUtils]: 4: Hoare triple {41#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {41#true} is VALID [2020-07-10 18:36:09,209 INFO L280 TraceCheckUtils]: 5: Hoare triple {41#true} ~m~0 := #t~nondet2; {41#true} is VALID [2020-07-10 18:36:09,209 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#true} havoc #t~nondet2; {41#true} is VALID [2020-07-10 18:36:09,210 INFO L280 TraceCheckUtils]: 7: Hoare triple {41#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {41#true} is VALID [2020-07-10 18:36:09,210 INFO L280 TraceCheckUtils]: 8: Hoare triple {41#true} ~n~0 := #t~nondet3; {41#true} is VALID [2020-07-10 18:36:09,211 INFO L280 TraceCheckUtils]: 9: Hoare triple {41#true} havoc #t~nondet3; {41#true} is VALID [2020-07-10 18:36:09,211 INFO L263 TraceCheckUtils]: 10: Hoare triple {41#true} call #t~ret4 := addition(~m~0, ~n~0); {41#true} is VALID [2020-07-10 18:36:09,212 INFO L280 TraceCheckUtils]: 11: Hoare triple {41#true} ~m := #in~m; {41#true} is VALID [2020-07-10 18:36:09,213 INFO L280 TraceCheckUtils]: 12: Hoare triple {41#true} ~n := #in~n; {52#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 18:36:09,214 INFO L280 TraceCheckUtils]: 13: Hoare triple {52#(= |addition_#in~n| addition_~n)} assume 0 == ~n; {53#(= 0 |addition_#in~n|)} is VALID [2020-07-10 18:36:09,216 INFO L280 TraceCheckUtils]: 14: Hoare triple {53#(= 0 |addition_#in~n|)} #res := ~m; {53#(= 0 |addition_#in~n|)} is VALID [2020-07-10 18:36:09,217 INFO L280 TraceCheckUtils]: 15: Hoare triple {53#(= 0 |addition_#in~n|)} assume true; {53#(= 0 |addition_#in~n|)} is VALID [2020-07-10 18:36:09,220 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {53#(= 0 |addition_#in~n|)} {41#true} #52#return; {51#(<= main_~n~0 0)} is VALID [2020-07-10 18:36:09,221 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-10 18:36:09,222 INFO L280 TraceCheckUtils]: 18: Hoare triple {51#(<= main_~n~0 0)} ~result~0 := #t~ret4; {51#(<= main_~n~0 0)} is VALID [2020-07-10 18:36:09,224 INFO L280 TraceCheckUtils]: 19: Hoare triple {51#(<= main_~n~0 0)} havoc #t~ret4; {51#(<= main_~n~0 0)} is VALID [2020-07-10 18:36:09,225 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-10 18:36:09,226 INFO L280 TraceCheckUtils]: 21: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-10 18:36:09,229 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-10 18:36:09,230 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:09,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [732369874] [2020-07-10 18:36:09,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:09,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 18:36:09,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355743755] [2020-07-10 18:36:09,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-10 18:36:09,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:09,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 18:36:09,306 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-10 18:36:09,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 18:36:09,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:09,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 18:36:09,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 18:36:09,319 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2020-07-10 18:36:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:09,712 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2020-07-10 18:36:09,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 18:36:09,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-10 18:36:09,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:09,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:36:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-10 18:36:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:36:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-10 18:36:09,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2020-07-10 18:36:09,840 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-10 18:36:09,854 INFO L225 Difference]: With dead ends: 53 [2020-07-10 18:36:09,854 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 18:36:09,859 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-10 18:36:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 18:36:09,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-10 18:36:09,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:09,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-10 18:36:09,933 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-10 18:36:09,934 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-10 18:36:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:09,941 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-10 18:36:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-10 18:36:09,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:09,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:09,943 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-10 18:36:09,944 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-10 18:36:09,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:09,950 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-10 18:36:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-10 18:36:09,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:09,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:09,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:09,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 18:36:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2020-07-10 18:36:09,958 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 22 [2020-07-10 18:36:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:09,959 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2020-07-10 18:36:09,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 18:36:09,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 40 transitions. [2020-07-10 18:36:10,034 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-10 18:36:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-10 18:36:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 18:36:10,036 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:10,036 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-10 18:36:10,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:36:10,037 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:10,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1947313727, now seen corresponding path program 1 times [2020-07-10 18:36:10,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:10,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1197780053] [2020-07-10 18:36:10,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:36:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:10,073 INFO L280 TraceCheckUtils]: 0: Hoare triple {304#true} assume true; {304#true} is VALID [2020-07-10 18:36:10,074 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {304#true} {304#true} #48#return; {304#true} is VALID [2020-07-10 18:36:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:10,105 INFO L280 TraceCheckUtils]: 0: Hoare triple {304#true} ~m := #in~m; {304#true} is VALID [2020-07-10 18:36:10,105 INFO L280 TraceCheckUtils]: 1: Hoare triple {304#true} ~n := #in~n; {304#true} is VALID [2020-07-10 18:36:10,106 INFO L280 TraceCheckUtils]: 2: Hoare triple {304#true} assume !(0 == ~n); {315#(not (= 0 addition_~n))} is VALID [2020-07-10 18:36:10,107 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-10 18:36:10,108 INFO L280 TraceCheckUtils]: 4: Hoare triple {316#(and (<= addition_~n 0) (not (= 0 addition_~n)))} assume !(~n < 0); {305#false} is VALID [2020-07-10 18:36:10,108 INFO L280 TraceCheckUtils]: 5: Hoare triple {305#false} assume true; {305#false} is VALID [2020-07-10 18:36:10,109 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {305#false} {304#true} #52#return; {305#false} is VALID [2020-07-10 18:36:10,109 INFO L263 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {304#true} is VALID [2020-07-10 18:36:10,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {304#true} assume true; {304#true} is VALID [2020-07-10 18:36:10,110 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {304#true} {304#true} #48#return; {304#true} is VALID [2020-07-10 18:36:10,110 INFO L263 TraceCheckUtils]: 3: Hoare triple {304#true} call #t~ret5 := main(); {304#true} is VALID [2020-07-10 18:36:10,111 INFO L280 TraceCheckUtils]: 4: Hoare triple {304#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {304#true} is VALID [2020-07-10 18:36:10,111 INFO L280 TraceCheckUtils]: 5: Hoare triple {304#true} ~m~0 := #t~nondet2; {304#true} is VALID [2020-07-10 18:36:10,111 INFO L280 TraceCheckUtils]: 6: Hoare triple {304#true} havoc #t~nondet2; {304#true} is VALID [2020-07-10 18:36:10,112 INFO L280 TraceCheckUtils]: 7: Hoare triple {304#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {304#true} is VALID [2020-07-10 18:36:10,112 INFO L280 TraceCheckUtils]: 8: Hoare triple {304#true} ~n~0 := #t~nondet3; {304#true} is VALID [2020-07-10 18:36:10,112 INFO L280 TraceCheckUtils]: 9: Hoare triple {304#true} havoc #t~nondet3; {304#true} is VALID [2020-07-10 18:36:10,113 INFO L263 TraceCheckUtils]: 10: Hoare triple {304#true} call #t~ret4 := addition(~m~0, ~n~0); {304#true} is VALID [2020-07-10 18:36:10,113 INFO L280 TraceCheckUtils]: 11: Hoare triple {304#true} ~m := #in~m; {304#true} is VALID [2020-07-10 18:36:10,113 INFO L280 TraceCheckUtils]: 12: Hoare triple {304#true} ~n := #in~n; {304#true} is VALID [2020-07-10 18:36:10,114 INFO L280 TraceCheckUtils]: 13: Hoare triple {304#true} assume !(0 == ~n); {315#(not (= 0 addition_~n))} is VALID [2020-07-10 18:36:10,115 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-10 18:36:10,116 INFO L280 TraceCheckUtils]: 15: Hoare triple {316#(and (<= addition_~n 0) (not (= 0 addition_~n)))} assume !(~n < 0); {305#false} is VALID [2020-07-10 18:36:10,116 INFO L280 TraceCheckUtils]: 16: Hoare triple {305#false} assume true; {305#false} is VALID [2020-07-10 18:36:10,117 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {305#false} {304#true} #52#return; {305#false} is VALID [2020-07-10 18:36:10,117 INFO L280 TraceCheckUtils]: 18: Hoare triple {305#false} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807; {305#false} is VALID [2020-07-10 18:36:10,117 INFO L280 TraceCheckUtils]: 19: Hoare triple {305#false} ~result~0 := #t~ret4; {305#false} is VALID [2020-07-10 18:36:10,118 INFO L280 TraceCheckUtils]: 20: Hoare triple {305#false} havoc #t~ret4; {305#false} is VALID [2020-07-10 18:36:10,118 INFO L280 TraceCheckUtils]: 21: Hoare triple {305#false} assume !((~m~0 < 100 || ~n~0 < 100) || ~result~0 >= 200); {305#false} is VALID [2020-07-10 18:36:10,118 INFO L280 TraceCheckUtils]: 22: Hoare triple {305#false} assume !false; {305#false} is VALID [2020-07-10 18:36:10,119 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-10 18:36:10,120 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:10,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1197780053] [2020-07-10 18:36:10,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:10,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 18:36:10,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515395505] [2020-07-10 18:36:10,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-10 18:36:10,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:10,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 18:36:10,148 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-10 18:36:10,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 18:36:10,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:10,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 18:36:10,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 18:36:10,150 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 4 states. [2020-07-10 18:36:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:10,300 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2020-07-10 18:36:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 18:36:10,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-10 18:36:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 18:36:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2020-07-10 18:36:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 18:36:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2020-07-10 18:36:10,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2020-07-10 18:36:10,386 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-10 18:36:10,389 INFO L225 Difference]: With dead ends: 51 [2020-07-10 18:36:10,389 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 18:36:10,391 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-10 18:36:10,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 18:36:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-07-10 18:36:10,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:10,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2020-07-10 18:36:10,451 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2020-07-10 18:36:10,451 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2020-07-10 18:36:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:10,462 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-10 18:36:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-10 18:36:10,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:10,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:10,468 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2020-07-10 18:36:10,468 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2020-07-10 18:36:10,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:10,476 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-10 18:36:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-10 18:36:10,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:10,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:10,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:10,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 18:36:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-10 18:36:10,487 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 23 [2020-07-10 18:36:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:10,487 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-10 18:36:10,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 18:36:10,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2020-07-10 18:36:10,550 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-10 18:36:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 18:36:10,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 18:36:10,552 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:10,553 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-10 18:36:10,554 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:36:10,555 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:10,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:10,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1438677315, now seen corresponding path program 1 times [2020-07-10 18:36:10,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:10,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [627279939] [2020-07-10 18:36:10,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:36:10,584 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:36:10,584 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-10 18:36:10,592 INFO L168 Benchmark]: Toolchain (without parser) took 2637.87 ms. Allocated memory was 144.7 MB in the beginning and 233.3 MB in the end (delta: 88.6 MB). Free memory was 101.5 MB in the beginning and 99.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 90.3 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:10,594 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 18:36:10,595 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.47 ms. Allocated memory is still 144.7 MB. Free memory was 101.2 MB in the beginning and 91.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:10,596 INFO L168 Benchmark]: Boogie Preprocessor took 117.43 ms. Allocated memory was 144.7 MB in the beginning and 200.8 MB in the end (delta: 56.1 MB). Free memory was 91.5 MB in the beginning and 179.5 MB in the end (delta: -88.0 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:10,598 INFO L168 Benchmark]: RCFGBuilder took 427.17 ms. Allocated memory is still 200.8 MB. Free memory was 179.5 MB in the beginning and 158.8 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:10,599 INFO L168 Benchmark]: TraceAbstraction took 1777.72 ms. Allocated memory was 200.8 MB in the beginning and 233.3 MB in the end (delta: 32.5 MB). Free memory was 158.8 MB in the beginning and 99.7 MB in the end (delta: 59.0 MB). Peak memory consumption was 91.5 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:10,603 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.24 ms. Allocated memory is still 144.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 301.47 ms. Allocated memory is still 144.7 MB. Free memory was 101.2 MB in the beginning and 91.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.43 ms. Allocated memory was 144.7 MB in the beginning and 200.8 MB in the end (delta: 56.1 MB). Free memory was 91.5 MB in the beginning and 179.5 MB in the end (delta: -88.0 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 427.17 ms. Allocated memory is still 200.8 MB. Free memory was 179.5 MB in the beginning and 158.8 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1777.72 ms. Allocated memory was 200.8 MB in the beginning and 233.3 MB in the end (delta: 32.5 MB). Free memory was 158.8 MB in the beginning and 99.7 MB in the end (delta: 59.0 MB). Peak memory consumption was 91.5 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...