/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-simple/id2_i5_o5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:38:34,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:38:34,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:38:34,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:38:34,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:38:34,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:38:34,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:38:34,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:38:34,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:38:34,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:38:34,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:38:34,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:38:34,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:38:34,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:38:34,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:38:34,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:38:34,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:38:34,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:38:34,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:38:34,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:38:34,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:38:34,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:38:34,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:38:34,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:38:34,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:38:34,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:38:34,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:38:34,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:38:34,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:38:34,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:38:34,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:38:34,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:38:34,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:38:34,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:38:34,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:38:34,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:38:34,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:38:34,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:38:34,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:38:34,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:38:34,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:38:34,901 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:38:34,928 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:38:34,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:38:34,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:38:34,933 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:38:34,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:38:34,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:38:34,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:38:34,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:38:34,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:38:34,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:38:34,934 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:38:34,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:38:34,935 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:38:34,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:38:34,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:38:34,938 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:38:34,938 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:38:34,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:38:34,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:38:34,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:38:34,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:38:34,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:38:34,939 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:38:35,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:38:35,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:38:35,258 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:38:35,260 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:38:35,260 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:38:35,261 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c [2020-07-10 18:38:35,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cab4e6a07/d7c7474f6cba488ca14acc96ad874126/FLAG3b967928a [2020-07-10 18:38:35,803 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:38:35,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c [2020-07-10 18:38:35,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cab4e6a07/d7c7474f6cba488ca14acc96ad874126/FLAG3b967928a [2020-07-10 18:38:36,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cab4e6a07/d7c7474f6cba488ca14acc96ad874126 [2020-07-10 18:38:36,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:38:36,161 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:38:36,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:38:36,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:38:36,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:38:36,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:38:36" (1/1) ... [2020-07-10 18:38:36,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1141d177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:36, skipping insertion in model container [2020-07-10 18:38:36,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:38:36" (1/1) ... [2020-07-10 18:38:36,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:38:36,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:38:36,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:38:36,435 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:38:36,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:38:36,477 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:38:36,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:36 WrapperNode [2020-07-10 18:38:36,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:38:36,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:38:36,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:38:36,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:38:36,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:36" (1/1) ... [2020-07-10 18:38:36,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:36" (1/1) ... [2020-07-10 18:38:36,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:36" (1/1) ... [2020-07-10 18:38:36,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:36" (1/1) ... [2020-07-10 18:38:36,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:36" (1/1) ... [2020-07-10 18:38:36,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:36" (1/1) ... [2020-07-10 18:38:36,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:36" (1/1) ... [2020-07-10 18:38:36,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:38:36,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:38:36,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:38:36,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:38:36,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:36" (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:38:36,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:38:36,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:38:36,659 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-10 18:38:36,659 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-07-10 18:38:36,659 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:38:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 18:38:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:38:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-10 18:38:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-07-10 18:38:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:38:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:38:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:38:36,901 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:38:36,901 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 18:38:36,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:38:36 BoogieIcfgContainer [2020-07-10 18:38:36,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:38:36,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:38:36,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:38:36,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:38:36,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:38:36" (1/3) ... [2020-07-10 18:38:36,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7569a772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:38:36, skipping insertion in model container [2020-07-10 18:38:36,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:38:36" (2/3) ... [2020-07-10 18:38:36,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7569a772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:38:36, skipping insertion in model container [2020-07-10 18:38:36,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:38:36" (3/3) ... [2020-07-10 18:38:36,914 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-1.c [2020-07-10 18:38:36,926 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:38:36,935 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:38:36,954 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:38:36,982 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:38:36,983 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:38:36,983 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:38:36,983 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:38:36,983 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:38:36,983 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:38:36,984 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:38:36,984 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:38:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-10 18:38:37,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 18:38:37,018 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:38:37,019 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:38:37,020 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:38:37,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:38:37,028 INFO L82 PathProgramCache]: Analyzing trace with hash -588914908, now seen corresponding path program 1 times [2020-07-10 18:38:37,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:38:37,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1382802378] [2020-07-10 18:38:37,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:38:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:37,327 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-10 18:38:37,327 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37#true} {37#true} #44#return; {37#true} is VALID [2020-07-10 18:38:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:37,377 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} ~x := #in~x; {47#(= |id_#in~x| id_~x)} is VALID [2020-07-10 18:38:37,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(= |id_#in~x| id_~x)} assume 0 == ~x; {48#(= 0 |id_#in~x|)} is VALID [2020-07-10 18:38:37,380 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#(= 0 |id_#in~x|)} #res := 0; {48#(= 0 |id_#in~x|)} is VALID [2020-07-10 18:38:37,382 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#(= 0 |id_#in~x|)} assume true; {48#(= 0 |id_#in~x|)} is VALID [2020-07-10 18:38:37,385 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#(= 0 |id_#in~x|)} {41#(<= 5 main_~input~0)} #48#return; {38#false} is VALID [2020-07-10 18:38:37,386 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2020-07-10 18:38:37,386 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-10 18:38:37,387 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #44#return; {37#true} is VALID [2020-07-10 18:38:37,387 INFO L263 TraceCheckUtils]: 3: Hoare triple {37#true} call #t~ret3 := main(); {37#true} is VALID [2020-07-10 18:38:37,389 INFO L280 TraceCheckUtils]: 4: Hoare triple {37#true} ~input~0 := 5; {41#(<= 5 main_~input~0)} is VALID [2020-07-10 18:38:37,389 INFO L263 TraceCheckUtils]: 5: Hoare triple {41#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {37#true} is VALID [2020-07-10 18:38:37,391 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} ~x := #in~x; {47#(= |id_#in~x| id_~x)} is VALID [2020-07-10 18:38:37,393 INFO L280 TraceCheckUtils]: 7: Hoare triple {47#(= |id_#in~x| id_~x)} assume 0 == ~x; {48#(= 0 |id_#in~x|)} is VALID [2020-07-10 18:38:37,395 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#(= 0 |id_#in~x|)} #res := 0; {48#(= 0 |id_#in~x|)} is VALID [2020-07-10 18:38:37,397 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#(= 0 |id_#in~x|)} assume true; {48#(= 0 |id_#in~x|)} is VALID [2020-07-10 18:38:37,399 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {48#(= 0 |id_#in~x|)} {41#(<= 5 main_~input~0)} #48#return; {38#false} is VALID [2020-07-10 18:38:37,400 INFO L280 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {38#false} is VALID [2020-07-10 18:38:37,400 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#false} ~result~0 := #t~ret2; {38#false} is VALID [2020-07-10 18:38:37,401 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#false} havoc #t~ret2; {38#false} is VALID [2020-07-10 18:38:37,401 INFO L280 TraceCheckUtils]: 14: Hoare triple {38#false} assume 5 == ~result~0; {38#false} is VALID [2020-07-10 18:38:37,401 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-10 18:38:37,404 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:38:37,404 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:38:37,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1382802378] [2020-07-10 18:38:37,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:38:37,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 18:38:37,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807241460] [2020-07-10 18:38:37,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-10 18:38:37,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:38:37,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 18:38:37,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:38:37,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 18:38:37,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:38:37,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 18:38:37,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 18:38:37,480 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2020-07-10 18:38:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:38:37,768 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-10 18:38:37,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 18:38:37,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-10 18:38:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:38:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:38:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-10 18:38:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:38:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-10 18:38:37,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2020-07-10 18:38:37,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:38:37,886 INFO L225 Difference]: With dead ends: 46 [2020-07-10 18:38:37,887 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 18:38:37,891 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:38:37,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 18:38:37,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-10 18:38:37,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:38:37,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-10 18:38:37,994 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 18:38:37,994 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 18:38:38,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:38:38,000 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-10 18:38:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-10 18:38:38,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:38:38,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:38:38,002 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 18:38:38,002 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 18:38:38,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:38:38,007 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-10 18:38:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-10 18:38:38,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:38:38,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:38:38,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:38:38,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:38:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 18:38:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-10 18:38:38,016 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 16 [2020-07-10 18:38:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:38:38,017 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-10 18:38:38,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 18:38:38,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-10 18:38:38,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:38:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-10 18:38:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 18:38:38,075 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:38:38,076 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:38:38,076 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:38:38,076 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:38:38,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:38:38,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1852809946, now seen corresponding path program 1 times [2020-07-10 18:38:38,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:38:38,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1249496800] [2020-07-10 18:38:38,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:38:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:38,126 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} assume true; {273#true} is VALID [2020-07-10 18:38:38,127 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2020-07-10 18:38:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:38,213 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 18:38:38,215 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-10 18:38:38,215 INFO L280 TraceCheckUtils]: 2: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-10 18:38:38,216 INFO L280 TraceCheckUtils]: 3: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-10 18:38:38,218 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {299#(= 0 |id2_#in~x|)} {291#(= |id_#in~x| id_~x)} #50#return; {297#(<= |id_#in~x| 1)} is VALID [2020-07-10 18:38:38,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} ~x := #in~x; {291#(= |id_#in~x| id_~x)} is VALID [2020-07-10 18:38:38,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {291#(= |id_#in~x| id_~x)} assume !(0 == ~x); {291#(= |id_#in~x| id_~x)} is VALID [2020-07-10 18:38:38,220 INFO L263 TraceCheckUtils]: 2: Hoare triple {291#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {273#true} is VALID [2020-07-10 18:38:38,221 INFO L280 TraceCheckUtils]: 3: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 18:38:38,222 INFO L280 TraceCheckUtils]: 4: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-10 18:38:38,223 INFO L280 TraceCheckUtils]: 5: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-10 18:38:38,224 INFO L280 TraceCheckUtils]: 6: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-10 18:38:38,225 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {299#(= 0 |id2_#in~x|)} {291#(= |id_#in~x| id_~x)} #50#return; {297#(<= |id_#in~x| 1)} is VALID [2020-07-10 18:38:38,226 INFO L280 TraceCheckUtils]: 8: Hoare triple {297#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {297#(<= |id_#in~x| 1)} is VALID [2020-07-10 18:38:38,227 INFO L280 TraceCheckUtils]: 9: Hoare triple {297#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-10 18:38:38,228 INFO L280 TraceCheckUtils]: 10: Hoare triple {297#(<= |id_#in~x| 1)} havoc #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-10 18:38:38,229 INFO L280 TraceCheckUtils]: 11: Hoare triple {297#(<= |id_#in~x| 1)} assume true; {297#(<= |id_#in~x| 1)} is VALID [2020-07-10 18:38:38,230 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {297#(<= |id_#in~x| 1)} {277#(<= 5 main_~input~0)} #48#return; {274#false} is VALID [2020-07-10 18:38:38,231 INFO L263 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2020-07-10 18:38:38,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {273#true} assume true; {273#true} is VALID [2020-07-10 18:38:38,232 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2020-07-10 18:38:38,232 INFO L263 TraceCheckUtils]: 3: Hoare triple {273#true} call #t~ret3 := main(); {273#true} is VALID [2020-07-10 18:38:38,233 INFO L280 TraceCheckUtils]: 4: Hoare triple {273#true} ~input~0 := 5; {277#(<= 5 main_~input~0)} is VALID [2020-07-10 18:38:38,234 INFO L263 TraceCheckUtils]: 5: Hoare triple {277#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {273#true} is VALID [2020-07-10 18:38:38,235 INFO L280 TraceCheckUtils]: 6: Hoare triple {273#true} ~x := #in~x; {291#(= |id_#in~x| id_~x)} is VALID [2020-07-10 18:38:38,235 INFO L280 TraceCheckUtils]: 7: Hoare triple {291#(= |id_#in~x| id_~x)} assume !(0 == ~x); {291#(= |id_#in~x| id_~x)} is VALID [2020-07-10 18:38:38,236 INFO L263 TraceCheckUtils]: 8: Hoare triple {291#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {273#true} is VALID [2020-07-10 18:38:38,236 INFO L280 TraceCheckUtils]: 9: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 18:38:38,237 INFO L280 TraceCheckUtils]: 10: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-10 18:38:38,238 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-10 18:38:38,239 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-10 18:38:38,241 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {299#(= 0 |id2_#in~x|)} {291#(= |id_#in~x| id_~x)} #50#return; {297#(<= |id_#in~x| 1)} is VALID [2020-07-10 18:38:38,242 INFO L280 TraceCheckUtils]: 14: Hoare triple {297#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {297#(<= |id_#in~x| 1)} is VALID [2020-07-10 18:38:38,243 INFO L280 TraceCheckUtils]: 15: Hoare triple {297#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-10 18:38:38,244 INFO L280 TraceCheckUtils]: 16: Hoare triple {297#(<= |id_#in~x| 1)} havoc #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-10 18:38:38,245 INFO L280 TraceCheckUtils]: 17: Hoare triple {297#(<= |id_#in~x| 1)} assume true; {297#(<= |id_#in~x| 1)} is VALID [2020-07-10 18:38:38,246 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {297#(<= |id_#in~x| 1)} {277#(<= 5 main_~input~0)} #48#return; {274#false} is VALID [2020-07-10 18:38:38,247 INFO L280 TraceCheckUtils]: 19: Hoare triple {274#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {274#false} is VALID [2020-07-10 18:38:38,247 INFO L280 TraceCheckUtils]: 20: Hoare triple {274#false} ~result~0 := #t~ret2; {274#false} is VALID [2020-07-10 18:38:38,247 INFO L280 TraceCheckUtils]: 21: Hoare triple {274#false} havoc #t~ret2; {274#false} is VALID [2020-07-10 18:38:38,248 INFO L280 TraceCheckUtils]: 22: Hoare triple {274#false} assume 5 == ~result~0; {274#false} is VALID [2020-07-10 18:38:38,248 INFO L280 TraceCheckUtils]: 23: Hoare triple {274#false} assume !false; {274#false} is VALID [2020-07-10 18:38:38,249 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:38:38,249 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:38:38,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1249496800] [2020-07-10 18:38:38,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:38:38,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 18:38:38,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531506939] [2020-07-10 18:38:38,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 18:38:38,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:38:38,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 18:38:38,285 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:38:38,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 18:38:38,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:38:38,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 18:38:38,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 18:38:38,287 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2020-07-10 18:38:38,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:38:38,637 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-07-10 18:38:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 18:38:38,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 18:38:38,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:38:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 18:38:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2020-07-10 18:38:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 18:38:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2020-07-10 18:38:38,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2020-07-10 18:38:38,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:38:38,731 INFO L225 Difference]: With dead ends: 45 [2020-07-10 18:38:38,731 INFO L226 Difference]: Without dead ends: 39 [2020-07-10 18:38:38,736 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-10 18:38:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-10 18:38:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-07-10 18:38:38,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:38:38,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2020-07-10 18:38:38,801 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2020-07-10 18:38:38,802 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2020-07-10 18:38:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:38:38,807 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-10 18:38:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-10 18:38:38,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:38:38,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:38:38,811 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2020-07-10 18:38:38,812 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2020-07-10 18:38:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:38:38,821 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-10 18:38:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-10 18:38:38,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:38:38,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:38:38,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:38:38,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:38:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 18:38:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2020-07-10 18:38:38,836 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2020-07-10 18:38:38,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:38:38,837 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-07-10 18:38:38,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 18:38:38,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2020-07-10 18:38:38,905 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:38:38,905 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-10 18:38:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 18:38:38,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:38:38,907 INFO L422 BasicCegarLoop]: trace histogram [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:38:38,908 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:38:38,908 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:38:38,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:38:38,909 INFO L82 PathProgramCache]: Analyzing trace with hash -238705980, now seen corresponding path program 1 times [2020-07-10 18:38:38,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:38:38,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [173358971] [2020-07-10 18:38:38,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 61 to 113 [2020-07-10 18:38:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:38:39,164 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} assume true; {548#true} is VALID [2020-07-10 18:38:39,165 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {548#true} {548#true} #44#return; {548#true} is VALID [2020-07-10 18:38:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 18:38:39,175 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:38:39,176 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: has to be unsat by construction, we do check only for interpolant computation at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:396) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:239) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:108) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolantsCraigNested(Interpolator.java:146) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolants(Interpolator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:279) 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:38:39,182 INFO L168 Benchmark]: Toolchain (without parser) took 3020.82 ms. Allocated memory was 145.2 MB in the beginning and 246.9 MB in the end (delta: 101.7 MB). Free memory was 103.7 MB in the beginning and 212.8 MB in the end (delta: -109.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 18:38:39,183 INFO L168 Benchmark]: CDTParser took 0.78 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 18:38:39,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.82 ms. Allocated memory is still 145.2 MB. Free memory was 103.5 MB in the beginning and 93.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-10 18:38:39,185 INFO L168 Benchmark]: Boogie Preprocessor took 34.98 ms. Allocated memory is still 145.2 MB. Free memory was 93.8 MB in the beginning and 92.4 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:38:39,186 INFO L168 Benchmark]: RCFGBuilder took 392.54 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 92.2 MB in the beginning and 164.5 MB in the end (delta: -72.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 18:38:39,187 INFO L168 Benchmark]: TraceAbstraction took 2271.90 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 163.8 MB in the beginning and 214.6 MB in the end (delta: -50.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 18:38:39,191 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.78 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 315.82 ms. Allocated memory is still 145.2 MB. Free memory was 103.5 MB in the beginning and 93.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.98 ms. Allocated memory is still 145.2 MB. Free memory was 93.8 MB in the beginning and 92.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 392.54 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 92.2 MB in the beginning and 164.5 MB in the end (delta: -72.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2271.90 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 163.8 MB in the beginning and 214.6 MB in the end (delta: -50.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: has to be unsat by construction, we do check only for interpolant computation de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: has to be unsat by construction, we do check only for interpolant computation: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:396) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...