/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/Addition02.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:36:06,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:36:06,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:36:06,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:36:06,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:36:06,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:36:06,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:36:06,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:36:06,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:36:06,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:36:06,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:36:06,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:36:06,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:36:06,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:36:06,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:36:06,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:36:06,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:36:06,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:36:06,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:36:06,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:36:06,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:36:06,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:36:06,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:36:06,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:36:06,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:36:06,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:36:06,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:36:06,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:36:06,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:36:06,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:36:06,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:36:06,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:36:06,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:36:06,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:36:06,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:36:06,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:36:06,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:36:06,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:36:06,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:36:06,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:36:06,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:36:06,430 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,441 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:36:06,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:36:06,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:36:06,443 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:36:06,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:36:06,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:36:06,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:36:06,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:36:06,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:36:06,445 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:36:06,445 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:36:06,445 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:36:06,445 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:36:06,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:36:06,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:36:06,446 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:36:06,446 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:36:06,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:36:06,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:36:06,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:36:06,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:36:06,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:36:06,448 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:36:06,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:36:06,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:36:06,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:36:06,742 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:36:06,742 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:36:06,743 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Addition02.c [2020-07-10 18:36:06,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a55597cb/d530e389af164d208aad458b8f7f1515/FLAG28d589b63 [2020-07-10 18:36:07,289 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:36:07,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Addition02.c [2020-07-10 18:36:07,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a55597cb/d530e389af164d208aad458b8f7f1515/FLAG28d589b63 [2020-07-10 18:36:07,658 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a55597cb/d530e389af164d208aad458b8f7f1515 [2020-07-10 18:36:07,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:36:07,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:36:07,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:36:07,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:36:07,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:36:07,676 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,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39032579 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,678 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,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:36:07,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:36:07,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:36:07,861 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:36:07,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:36:07,894 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:36:07,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:07 WrapperNode [2020-07-10 18:36:07,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:36:07,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:36:07,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:36:07,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:36:07,905 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:07" (1/1) ... [2020-07-10 18:36:07,906 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:07" (1/1) ... [2020-07-10 18:36:07,910 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:07" (1/1) ... [2020-07-10 18:36:07,910 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:07" (1/1) ... [2020-07-10 18:36:07,915 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:07" (1/1) ... [2020-07-10 18:36:07,918 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:07" (1/1) ... [2020-07-10 18:36:07,919 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:07" (1/1) ... [2020-07-10 18:36:07,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:36:07,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:36:07,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:36:07,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:36:07,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:07" (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,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:36:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:36:08,069 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2020-07-10 18:36:08,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:36:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:36:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 18:36:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2020-07-10 18:36:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:36:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:36:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:36:08,395 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:36:08,396 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 18:36:08,400 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,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:36:08,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:36:08,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:36:08,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:36:08,405 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,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44462766 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,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:07" (2/3) ... [2020-07-10 18:36:08,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44462766 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,407 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,409 INFO L109 eAbstractionObserver]: Analyzing ICFG Addition02.c [2020-07-10 18:36:08,420 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:36:08,427 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:36:08,441 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:36:08,470 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:36:08,471 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:36:08,471 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:36:08,471 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:36:08,471 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:36:08,471 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:36:08,471 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:36:08,471 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:36:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-07-10 18:36:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 18:36:08,505 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:08,506 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, 1] [2020-07-10 18:36:08,506 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:08,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:08,512 INFO L82 PathProgramCache]: Analyzing trace with hash 935018920, now seen corresponding path program 1 times [2020-07-10 18:36:08,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:08,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1575360229] [2020-07-10 18:36:08,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:36:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:08,837 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-10 18:36:08,837 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {45#true} {45#true} #58#return; {45#true} is VALID [2020-07-10 18:36:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:08,999 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#true} ~m := #in~m; {58#(= |addition_#in~m| addition_~m)} is VALID [2020-07-10 18:36:09,001 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(= |addition_#in~m| addition_~m)} ~n := #in~n; {59#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 18:36:09,002 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n; {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 18:36:09,003 INFO L280 TraceCheckUtils]: 3: Hoare triple {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} #res := ~m; {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 18:36:09,005 INFO L280 TraceCheckUtils]: 4: Hoare triple {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 18:36:09,007 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {49#(<= 0 main_~n~0)} #62#return; {56#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} is VALID [2020-07-10 18:36:09,009 INFO L263 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2020-07-10 18:36:09,009 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-10 18:36:09,010 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #58#return; {45#true} is VALID [2020-07-10 18:36:09,010 INFO L263 TraceCheckUtils]: 3: Hoare triple {45#true} call #t~ret5 := main(); {45#true} is VALID [2020-07-10 18:36:09,011 INFO L280 TraceCheckUtils]: 4: Hoare triple {45#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {45#true} is VALID [2020-07-10 18:36:09,011 INFO L280 TraceCheckUtils]: 5: Hoare triple {45#true} ~m~0 := #t~nondet2; {45#true} is VALID [2020-07-10 18:36:09,012 INFO L280 TraceCheckUtils]: 6: Hoare triple {45#true} havoc #t~nondet2; {45#true} is VALID [2020-07-10 18:36:09,012 INFO L280 TraceCheckUtils]: 7: Hoare triple {45#true} assume !(~m~0 < 0 || ~m~0 > 1073741823); {45#true} is VALID [2020-07-10 18:36:09,013 INFO L280 TraceCheckUtils]: 8: Hoare triple {45#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {45#true} is VALID [2020-07-10 18:36:09,013 INFO L280 TraceCheckUtils]: 9: Hoare triple {45#true} ~n~0 := #t~nondet3; {45#true} is VALID [2020-07-10 18:36:09,014 INFO L280 TraceCheckUtils]: 10: Hoare triple {45#true} havoc #t~nondet3; {45#true} is VALID [2020-07-10 18:36:09,015 INFO L280 TraceCheckUtils]: 11: Hoare triple {45#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {49#(<= 0 main_~n~0)} is VALID [2020-07-10 18:36:09,016 INFO L263 TraceCheckUtils]: 12: Hoare triple {49#(<= 0 main_~n~0)} call #t~ret4 := addition(~m~0, ~n~0); {45#true} is VALID [2020-07-10 18:36:09,017 INFO L280 TraceCheckUtils]: 13: Hoare triple {45#true} ~m := #in~m; {58#(= |addition_#in~m| addition_~m)} is VALID [2020-07-10 18:36:09,018 INFO L280 TraceCheckUtils]: 14: Hoare triple {58#(= |addition_#in~m| addition_~m)} ~n := #in~n; {59#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 18:36:09,019 INFO L280 TraceCheckUtils]: 15: Hoare triple {59#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n; {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 18:36:09,020 INFO L280 TraceCheckUtils]: 16: Hoare triple {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} #res := ~m; {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 18:36:09,021 INFO L280 TraceCheckUtils]: 17: Hoare triple {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 18:36:09,023 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {49#(<= 0 main_~n~0)} #62#return; {56#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} is VALID [2020-07-10 18:36:09,024 INFO L280 TraceCheckUtils]: 19: Hoare triple {56#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {56#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} is VALID [2020-07-10 18:36:09,026 INFO L280 TraceCheckUtils]: 20: Hoare triple {56#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} ~result~0 := #t~ret4; {57#(and (<= main_~m~0 (+ main_~result~0 main_~n~0)) (<= (+ main_~result~0 main_~n~0) main_~m~0))} is VALID [2020-07-10 18:36:09,027 INFO L280 TraceCheckUtils]: 21: Hoare triple {57#(and (<= main_~m~0 (+ main_~result~0 main_~n~0)) (<= (+ main_~result~0 main_~n~0) main_~m~0))} havoc #t~ret4; {57#(and (<= main_~m~0 (+ main_~result~0 main_~n~0)) (<= (+ main_~result~0 main_~n~0) main_~m~0))} is VALID [2020-07-10 18:36:09,028 INFO L280 TraceCheckUtils]: 22: Hoare triple {57#(and (<= main_~m~0 (+ main_~result~0 main_~n~0)) (<= (+ main_~result~0 main_~n~0) main_~m~0))} assume !(~result~0 == ~m~0 - ~n~0); {46#false} is VALID [2020-07-10 18:36:09,028 INFO L280 TraceCheckUtils]: 23: Hoare triple {46#false} assume !false; {46#false} is VALID [2020-07-10 18:36:09,032 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,033 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:09,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1575360229] [2020-07-10 18:36:09,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:09,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 18:36:09,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635834585] [2020-07-10 18:36:09,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-10 18:36:09,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:09,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 18:36:09,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:09,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 18:36:09,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:09,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 18:36:09,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-10 18:36:09,108 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 9 states. [2020-07-10 18:36:09,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:09,925 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2020-07-10 18:36:09,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 18:36:09,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-10 18:36:09,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 18:36:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2020-07-10 18:36:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 18:36:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2020-07-10 18:36:09,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2020-07-10 18:36:10,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:10,041 INFO L225 Difference]: With dead ends: 56 [2020-07-10 18:36:10,041 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 18:36:10,045 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-07-10 18:36:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 18:36:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-10 18:36:10,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:10,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-10 18:36:10,134 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-10 18:36:10,135 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-10 18:36:10,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:10,142 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-10 18:36:10,142 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-10 18:36:10,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:10,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:10,144 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-10 18:36:10,144 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-10 18:36:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:10,150 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-10 18:36:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-10 18:36:10,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:10,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:10,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:10,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:10,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 18:36:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2020-07-10 18:36:10,159 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 24 [2020-07-10 18:36:10,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:10,160 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2020-07-10 18:36:10,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 18:36:10,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 42 transitions. [2020-07-10 18:36:10,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-10 18:36:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 18:36:10,220 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:10,221 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, 1, 1] [2020-07-10 18:36:10,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:36:10,221 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:10,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:10,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2135506668, now seen corresponding path program 1 times [2020-07-10 18:36:10,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:10,223 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1478873250] [2020-07-10 18:36:10,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:36:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:10,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {334#true} assume true; {334#true} is VALID [2020-07-10 18:36:10,267 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2020-07-10 18:36:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:10,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {334#true} ~m := #in~m; {334#true} is VALID [2020-07-10 18:36:10,334 INFO L280 TraceCheckUtils]: 1: Hoare triple {334#true} ~n := #in~n; {346#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 18:36:10,335 INFO L280 TraceCheckUtils]: 2: Hoare triple {346#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {347#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-10 18:36:10,336 INFO L280 TraceCheckUtils]: 3: Hoare triple {347#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} assume !(~n > 0); {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-10 18:36:10,337 INFO L280 TraceCheckUtils]: 4: Hoare triple {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume !(~n < 0); {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-10 18:36:10,338 INFO L280 TraceCheckUtils]: 5: Hoare triple {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume true; {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-10 18:36:10,339 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} {338#(<= 0 main_~n~0)} #62#return; {335#false} is VALID [2020-07-10 18:36:10,340 INFO L263 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2020-07-10 18:36:10,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {334#true} assume true; {334#true} is VALID [2020-07-10 18:36:10,341 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2020-07-10 18:36:10,341 INFO L263 TraceCheckUtils]: 3: Hoare triple {334#true} call #t~ret5 := main(); {334#true} is VALID [2020-07-10 18:36:10,342 INFO L280 TraceCheckUtils]: 4: Hoare triple {334#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {334#true} is VALID [2020-07-10 18:36:10,342 INFO L280 TraceCheckUtils]: 5: Hoare triple {334#true} ~m~0 := #t~nondet2; {334#true} is VALID [2020-07-10 18:36:10,342 INFO L280 TraceCheckUtils]: 6: Hoare triple {334#true} havoc #t~nondet2; {334#true} is VALID [2020-07-10 18:36:10,351 INFO L280 TraceCheckUtils]: 7: Hoare triple {334#true} assume !(~m~0 < 0 || ~m~0 > 1073741823); {334#true} is VALID [2020-07-10 18:36:10,351 INFO L280 TraceCheckUtils]: 8: Hoare triple {334#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {334#true} is VALID [2020-07-10 18:36:10,351 INFO L280 TraceCheckUtils]: 9: Hoare triple {334#true} ~n~0 := #t~nondet3; {334#true} is VALID [2020-07-10 18:36:10,352 INFO L280 TraceCheckUtils]: 10: Hoare triple {334#true} havoc #t~nondet3; {334#true} is VALID [2020-07-10 18:36:10,357 INFO L280 TraceCheckUtils]: 11: Hoare triple {334#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {338#(<= 0 main_~n~0)} is VALID [2020-07-10 18:36:10,358 INFO L263 TraceCheckUtils]: 12: Hoare triple {338#(<= 0 main_~n~0)} call #t~ret4 := addition(~m~0, ~n~0); {334#true} is VALID [2020-07-10 18:36:10,358 INFO L280 TraceCheckUtils]: 13: Hoare triple {334#true} ~m := #in~m; {334#true} is VALID [2020-07-10 18:36:10,359 INFO L280 TraceCheckUtils]: 14: Hoare triple {334#true} ~n := #in~n; {346#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 18:36:10,360 INFO L280 TraceCheckUtils]: 15: Hoare triple {346#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {347#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-10 18:36:10,360 INFO L280 TraceCheckUtils]: 16: Hoare triple {347#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} assume !(~n > 0); {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-10 18:36:10,361 INFO L280 TraceCheckUtils]: 17: Hoare triple {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume !(~n < 0); {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-10 18:36:10,362 INFO L280 TraceCheckUtils]: 18: Hoare triple {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume true; {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-10 18:36:10,363 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} {338#(<= 0 main_~n~0)} #62#return; {335#false} is VALID [2020-07-10 18:36:10,364 INFO L280 TraceCheckUtils]: 20: Hoare triple {335#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {335#false} is VALID [2020-07-10 18:36:10,364 INFO L280 TraceCheckUtils]: 21: Hoare triple {335#false} ~result~0 := #t~ret4; {335#false} is VALID [2020-07-10 18:36:10,364 INFO L280 TraceCheckUtils]: 22: Hoare triple {335#false} havoc #t~ret4; {335#false} is VALID [2020-07-10 18:36:10,365 INFO L280 TraceCheckUtils]: 23: Hoare triple {335#false} assume !(~result~0 == ~m~0 - ~n~0); {335#false} is VALID [2020-07-10 18:36:10,365 INFO L280 TraceCheckUtils]: 24: Hoare triple {335#false} assume !false; {335#false} is VALID [2020-07-10 18:36:10,366 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,366 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:10,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1478873250] [2020-07-10 18:36:10,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:10,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:36:10,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080350935] [2020-07-10 18:36:10,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-10 18:36:10,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:10,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:36:10,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:10,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:36:10,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:10,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:36:10,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:36:10,396 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 6 states. [2020-07-10 18:36:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:10,725 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2020-07-10 18:36:10,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 18:36:10,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-10 18:36:10,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:36:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2020-07-10 18:36:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:36:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2020-07-10 18:36:10,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2020-07-10 18:36:10,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:10,822 INFO L225 Difference]: With dead ends: 56 [2020-07-10 18:36:10,823 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 18:36:10,826 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-10 18:36:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 18:36:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-10 18:36:10,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:10,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-10 18:36:10,867 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 18:36:10,868 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 18:36:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:10,871 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-10 18:36:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-10 18:36:10,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:10,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:10,872 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 18:36:10,872 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 18:36:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:10,875 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-10 18:36:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-10 18:36:10,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:10,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:10,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:10,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 18:36:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-10 18:36:10,880 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-07-10 18:36:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:10,880 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-10 18:36:10,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:36:10,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-10 18:36:10,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-10 18:36:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 18:36:10,913 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:10,914 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, 1, 1] [2020-07-10 18:36:10,914 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:36:10,914 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:10,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1044754306, now seen corresponding path program 1 times [2020-07-10 18:36:10,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:10,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1173780710] [2020-07-10 18:36:10,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:36:10,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:36:10,939 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,944 INFO L168 Benchmark]: Toolchain (without parser) took 3273.52 ms. Allocated memory was 144.7 MB in the beginning and 248.5 MB in the end (delta: 103.8 MB). Free memory was 103.1 MB in the beginning and 127.8 MB in the end (delta: -24.6 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:10,945 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 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,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.48 ms. Allocated memory is still 144.7 MB. Free memory was 102.9 MB in the beginning and 92.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:10,947 INFO L168 Benchmark]: Boogie Preprocessor took 25.17 ms. Allocated memory is still 144.7 MB. Free memory was 92.9 MB in the beginning and 91.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:10,948 INFO L168 Benchmark]: RCFGBuilder took 479.35 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 91.3 MB in the beginning and 159.6 MB in the end (delta: -68.3 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:10,949 INFO L168 Benchmark]: TraceAbstraction took 2539.82 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 158.9 MB in the beginning and 127.8 MB in the end (delta: 31.1 MB). Peak memory consumption was 77.8 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:10,953 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.18 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 223.48 ms. Allocated memory is still 144.7 MB. Free memory was 102.9 MB in the beginning and 92.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.17 ms. Allocated memory is still 144.7 MB. Free memory was 92.9 MB in the beginning and 91.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 479.35 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 91.3 MB in the beginning and 159.6 MB in the end (delta: -68.3 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2539.82 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 158.9 MB in the beginning and 127.8 MB in the end (delta: 31.1 MB). Peak memory consumption was 77.8 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...